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/bitvector/s3_srvr_3_alt.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:44:40,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:44:40,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:44:40,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:44:40,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:44:40,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:44:40,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:44:40,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:44:40,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:44:40,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:44:40,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:44:40,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:44:40,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:44:40,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:44:40,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:44:40,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:44:40,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:44:40,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:44:40,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:44:40,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:44:40,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:44:40,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:44:40,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:44:40,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:44:40,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:44:40,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:44:40,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:44:40,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:44:40,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:44:40,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:44:40,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:44:40,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:44:40,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:44:40,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:44:40,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:44:40,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:44:40,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:44:40,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:44:40,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:44:40,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:44:40,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:44:40,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:44:40,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:44:40,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:44:40,291 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:44:40,292 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:44:40,292 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:44:40,293 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:44:40,293 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:44:40,293 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:44:40,293 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:44:40,293 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:44:40,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:44:40,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:44:40,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:44:40,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:44:40,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:44:40,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:44:40,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:44:40,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:44:40,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:44:40,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:44:40,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:44:40,296 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:44:40,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:44:40,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:40,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:44:40,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:44:40,297 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:44:40,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:44:40,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:44:40,298 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:44:40,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:44:40,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:44:40,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:44:40,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:44:40,351 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:44:40,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_3_alt.BV.c.cil.c [2019-09-09 05:44:40,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc7652fe/9ae7ab5531a1455fbc8e00a89518549f/FLAGac7c0b0b2 [2019-09-09 05:44:40,895 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:44:40,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_3_alt.BV.c.cil.c [2019-09-09 05:44:40,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc7652fe/9ae7ab5531a1455fbc8e00a89518549f/FLAGac7c0b0b2 [2019-09-09 05:44:41,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc7652fe/9ae7ab5531a1455fbc8e00a89518549f [2019-09-09 05:44:41,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:44:41,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:44:41,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:41,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:44:41,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:44:41,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6d8891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41, skipping insertion in model container [2019-09-09 05:44:41,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,258 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:44:41,296 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:44:41,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:41,554 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:44:41,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:41,721 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:44:41,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41 WrapperNode [2019-09-09 05:44:41,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:41,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:44:41,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:44:41,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:44:41,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (1/1) ... [2019-09-09 05:44:41,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:44:41,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:44:41,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:44:41,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:44:41,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:44:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:44:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:44:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:44:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:44:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:44:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:44:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:44:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:44:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:44:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:44:42,018 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:44:42,570 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:44:42,571 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:44:42,573 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:44:42,573 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:44:42,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:42 BoogieIcfgContainer [2019-09-09 05:44:42,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:44:42,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:44:42,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:44:42,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:44:42,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:44:41" (1/3) ... [2019-09-09 05:44:42,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667f3ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:42, skipping insertion in model container [2019-09-09 05:44:42,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:41" (2/3) ... [2019-09-09 05:44:42,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667f3ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:42, skipping insertion in model container [2019-09-09 05:44:42,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:42" (3/3) ... [2019-09-09 05:44:42,582 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c [2019-09-09 05:44:42,592 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:44:42,599 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:44:42,614 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:44:42,640 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:44:42,640 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:44:42,640 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:44:42,641 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:44:42,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:44:42,641 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:44:42,641 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:44:42,641 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:44:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-09-09 05:44:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:44:42,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:42,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:42,677 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:42,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:42,681 INFO L82 PathProgramCache]: Analyzing trace with hash -459257302, now seen corresponding path program 1 times [2019-09-09 05:44:42,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:42,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:42,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:42,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:42,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:43,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:43,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:43,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:43,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:43,049 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2019-09-09 05:44:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:43,456 INFO L93 Difference]: Finished difference Result 199 states and 335 transitions. [2019-09-09 05:44:43,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:43,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-09 05:44:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:43,480 INFO L225 Difference]: With dead ends: 199 [2019-09-09 05:44:43,480 INFO L226 Difference]: Without dead ends: 176 [2019-09-09 05:44:43,482 INFO L628 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-09-09 05:44:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-09 05:44:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2019-09-09 05:44:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-09 05:44:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-09-09 05:44:43,575 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 49 [2019-09-09 05:44:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:43,577 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-09-09 05:44:43,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-09-09 05:44:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:44:43,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:43,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:43,581 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:43,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1359139796, now seen corresponding path program 1 times [2019-09-09 05:44:43,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:43,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:43,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:43,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:43,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:43,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:43,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:43,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:43,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:43,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:43,709 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 5 states. [2019-09-09 05:44:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:44,074 INFO L93 Difference]: Finished difference Result 219 states and 361 transitions. [2019-09-09 05:44:44,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:44,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-09 05:44:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:44,078 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:44:44,078 INFO L226 Difference]: Without dead ends: 217 [2019-09-09 05:44:44,081 INFO L628 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-09-09 05:44:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-09 05:44:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2019-09-09 05:44:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-09 05:44:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 353 transitions. [2019-09-09 05:44:44,109 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 353 transitions. Word has length 50 [2019-09-09 05:44:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:44,109 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 353 transitions. [2019-09-09 05:44:44,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 353 transitions. [2019-09-09 05:44:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:44:44,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:44,121 INFO L399 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-09-09 05:44:44,122 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:44,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:44,122 INFO L82 PathProgramCache]: Analyzing trace with hash -250817147, now seen corresponding path program 1 times [2019-09-09 05:44:44,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:44,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:44,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:44,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:44,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:44,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:44,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:44,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:44,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:44,262 INFO L87 Difference]: Start difference. First operand 212 states and 353 transitions. Second operand 5 states. [2019-09-09 05:44:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:44,522 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2019-09-09 05:44:44,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:44,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-09 05:44:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:44,525 INFO L225 Difference]: With dead ends: 243 [2019-09-09 05:44:44,525 INFO L226 Difference]: Without dead ends: 243 [2019-09-09 05:44:44,526 INFO L628 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-09-09 05:44:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-09 05:44:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-09-09 05:44:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-09 05:44:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 409 transitions. [2019-09-09 05:44:44,538 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 409 transitions. Word has length 77 [2019-09-09 05:44:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:44,538 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 409 transitions. [2019-09-09 05:44:44,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 409 transitions. [2019-09-09 05:44:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:44:44,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:44,543 INFO L399 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-09-09 05:44:44,543 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:44,544 INFO L82 PathProgramCache]: Analyzing trace with hash -508376229, now seen corresponding path program 1 times [2019-09-09 05:44:44,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:44,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:44,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:44,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:44,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:44,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:44,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:44,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:44,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:44,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:44,611 INFO L87 Difference]: Start difference. First operand 243 states and 409 transitions. Second operand 5 states. [2019-09-09 05:44:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:44,817 INFO L93 Difference]: Finished difference Result 260 states and 434 transitions. [2019-09-09 05:44:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:44,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:44:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:44,821 INFO L225 Difference]: With dead ends: 260 [2019-09-09 05:44:44,821 INFO L226 Difference]: Without dead ends: 260 [2019-09-09 05:44:44,822 INFO L628 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-09-09 05:44:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-09 05:44:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-09-09 05:44:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:44:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 432 transitions. [2019-09-09 05:44:44,832 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 432 transitions. Word has length 89 [2019-09-09 05:44:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:44,833 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 432 transitions. [2019-09-09 05:44:44,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 432 transitions. [2019-09-09 05:44:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:44:44,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:44,837 INFO L399 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-09-09 05:44:44,837 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 384668356, now seen corresponding path program 1 times [2019-09-09 05:44:44,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:44,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:44,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:44,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:44,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:44,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:44,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:44,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:44,936 INFO L87 Difference]: Start difference. First operand 258 states and 432 transitions. Second operand 5 states. [2019-09-09 05:44:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:45,199 INFO L93 Difference]: Finished difference Result 304 states and 511 transitions. [2019-09-09 05:44:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:45,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:44:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:45,201 INFO L225 Difference]: With dead ends: 304 [2019-09-09 05:44:45,202 INFO L226 Difference]: Without dead ends: 304 [2019-09-09 05:44:45,202 INFO L628 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-09-09 05:44:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-09 05:44:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2019-09-09 05:44:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-09 05:44:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 506 transitions. [2019-09-09 05:44:45,211 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 506 transitions. Word has length 89 [2019-09-09 05:44:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:45,212 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 506 transitions. [2019-09-09 05:44:45,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 506 transitions. [2019-09-09 05:44:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:44:45,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:45,214 INFO L399 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-09-09 05:44:45,214 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1150340194, now seen corresponding path program 1 times [2019-09-09 05:44:45,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:45,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:45,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:45,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:45,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:45,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:45,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:45,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:45,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:45,270 INFO L87 Difference]: Start difference. First operand 300 states and 506 transitions. Second operand 5 states. [2019-09-09 05:44:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:45,504 INFO L93 Difference]: Finished difference Result 302 states and 504 transitions. [2019-09-09 05:44:45,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:45,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:44:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:45,509 INFO L225 Difference]: With dead ends: 302 [2019-09-09 05:44:45,509 INFO L226 Difference]: Without dead ends: 302 [2019-09-09 05:44:45,510 INFO L628 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-09-09 05:44:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-09 05:44:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-09-09 05:44:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-09 05:44:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 502 transitions. [2019-09-09 05:44:45,522 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 502 transitions. Word has length 90 [2019-09-09 05:44:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:45,522 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 502 transitions. [2019-09-09 05:44:45,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 502 transitions. [2019-09-09 05:44:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:44:45,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:45,525 INFO L399 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-09-09 05:44:45,525 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:45,525 INFO L82 PathProgramCache]: Analyzing trace with hash 12513126, now seen corresponding path program 1 times [2019-09-09 05:44:45,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:45,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:45,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:45,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:45,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:45,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:45,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:45,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:45,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:45,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:45,659 INFO L87 Difference]: Start difference. First operand 300 states and 502 transitions. Second operand 5 states. [2019-09-09 05:44:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:45,943 INFO L93 Difference]: Finished difference Result 304 states and 505 transitions. [2019-09-09 05:44:45,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:45,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:44:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:45,945 INFO L225 Difference]: With dead ends: 304 [2019-09-09 05:44:45,946 INFO L226 Difference]: Without dead ends: 302 [2019-09-09 05:44:45,946 INFO L628 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-09-09 05:44:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-09 05:44:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-09-09 05:44:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-09 05:44:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 497 transitions. [2019-09-09 05:44:45,957 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 497 transitions. Word has length 90 [2019-09-09 05:44:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:45,958 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 497 transitions. [2019-09-09 05:44:45,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 497 transitions. [2019-09-09 05:44:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:44:45,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:45,959 INFO L399 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] [2019-09-09 05:44:45,960 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:45,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1256654058, now seen corresponding path program 1 times [2019-09-09 05:44:45,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:45,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:45,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:44:46,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:46,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:46,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:46,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:46,037 INFO L87 Difference]: Start difference. First operand 298 states and 497 transitions. Second operand 5 states. [2019-09-09 05:44:46,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:46,190 INFO L93 Difference]: Finished difference Result 306 states and 502 transitions. [2019-09-09 05:44:46,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:46,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-09 05:44:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:46,193 INFO L225 Difference]: With dead ends: 306 [2019-09-09 05:44:46,193 INFO L226 Difference]: Without dead ends: 306 [2019-09-09 05:44:46,194 INFO L628 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-09-09 05:44:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-09 05:44:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-09-09 05:44:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-09 05:44:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2019-09-09 05:44:46,202 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 101 [2019-09-09 05:44:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:46,203 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2019-09-09 05:44:46,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2019-09-09 05:44:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:44:46,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:46,204 INFO L399 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-09-09 05:44:46,205 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:46,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash -315055682, now seen corresponding path program 1 times [2019-09-09 05:44:46,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:46,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:46,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:46,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:46,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:46,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:46,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:46,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:46,255 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 5 states. [2019-09-09 05:44:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:46,472 INFO L93 Difference]: Finished difference Result 337 states and 551 transitions. [2019-09-09 05:44:46,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:46,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-09 05:44:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:46,475 INFO L225 Difference]: With dead ends: 337 [2019-09-09 05:44:46,476 INFO L226 Difference]: Without dead ends: 337 [2019-09-09 05:44:46,476 INFO L628 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-09-09 05:44:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-09 05:44:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2019-09-09 05:44:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-09 05:44:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2019-09-09 05:44:46,485 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 103 [2019-09-09 05:44:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:46,486 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2019-09-09 05:44:46,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2019-09-09 05:44:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:44:46,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:46,488 INFO L399 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] [2019-09-09 05:44:46,488 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1874973505, now seen corresponding path program 1 times [2019-09-09 05:44:46,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:46,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:46,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:46,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:46,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:46,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:46,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:46,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:46,581 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 5 states. [2019-09-09 05:44:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:46,796 INFO L93 Difference]: Finished difference Result 369 states and 603 transitions. [2019-09-09 05:44:46,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:46,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:44:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:46,803 INFO L225 Difference]: With dead ends: 369 [2019-09-09 05:44:46,803 INFO L226 Difference]: Without dead ends: 369 [2019-09-09 05:44:46,804 INFO L628 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-09-09 05:44:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-09 05:44:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2019-09-09 05:44:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:44:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 591 transitions. [2019-09-09 05:44:46,814 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 591 transitions. Word has length 104 [2019-09-09 05:44:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:46,814 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 591 transitions. [2019-09-09 05:44:46,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 591 transitions. [2019-09-09 05:44:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:44:46,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:46,817 INFO L399 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-09-09 05:44:46,817 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:46,818 INFO L82 PathProgramCache]: Analyzing trace with hash -411681051, now seen corresponding path program 1 times [2019-09-09 05:44:46,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:46,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:46,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:46,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:46,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:46,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:46,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:46,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:46,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:46,866 INFO L87 Difference]: Start difference. First operand 362 states and 591 transitions. Second operand 5 states. [2019-09-09 05:44:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:47,049 INFO L93 Difference]: Finished difference Result 364 states and 589 transitions. [2019-09-09 05:44:47,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:47,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:44:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:47,051 INFO L225 Difference]: With dead ends: 364 [2019-09-09 05:44:47,052 INFO L226 Difference]: Without dead ends: 364 [2019-09-09 05:44:47,052 INFO L628 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-09-09 05:44:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-09 05:44:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2019-09-09 05:44:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:44:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2019-09-09 05:44:47,061 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 104 [2019-09-09 05:44:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:47,061 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2019-09-09 05:44:47,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2019-09-09 05:44:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:44:47,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:47,064 INFO L399 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] [2019-09-09 05:44:47,064 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1317457818, now seen corresponding path program 1 times [2019-09-09 05:44:47,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:47,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:47,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:47,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:47,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:44:47,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:47,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:47,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:47,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:47,108 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 5 states. [2019-09-09 05:44:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:47,296 INFO L93 Difference]: Finished difference Result 369 states and 594 transitions. [2019-09-09 05:44:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:47,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-09 05:44:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:47,299 INFO L225 Difference]: With dead ends: 369 [2019-09-09 05:44:47,299 INFO L226 Difference]: Without dead ends: 369 [2019-09-09 05:44:47,299 INFO L628 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-09-09 05:44:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-09 05:44:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2019-09-09 05:44:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-09 05:44:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2019-09-09 05:44:47,309 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 105 [2019-09-09 05:44:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:47,310 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2019-09-09 05:44:47,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2019-09-09 05:44:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:44:47,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:47,312 INFO L399 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-09-09 05:44:47,312 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash -817214863, now seen corresponding path program 1 times [2019-09-09 05:44:47,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:47,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:47,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:47,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:47,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:44:47,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:47,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:47,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:47,379 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 5 states. [2019-09-09 05:44:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:47,613 INFO L93 Difference]: Finished difference Result 387 states and 617 transitions. [2019-09-09 05:44:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:47,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-09 05:44:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:47,617 INFO L225 Difference]: With dead ends: 387 [2019-09-09 05:44:47,617 INFO L226 Difference]: Without dead ends: 387 [2019-09-09 05:44:47,617 INFO L628 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-09-09 05:44:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-09 05:44:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-09 05:44:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-09 05:44:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2019-09-09 05:44:47,627 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 110 [2019-09-09 05:44:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:47,628 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2019-09-09 05:44:47,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2019-09-09 05:44:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:44:47,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:47,631 INFO L399 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-09-09 05:44:47,632 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1429215766, now seen corresponding path program 1 times [2019-09-09 05:44:47,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:47,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:47,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:44:47,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:47,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:47,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:47,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:47,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:47,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:47,688 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 5 states. [2019-09-09 05:44:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:47,908 INFO L93 Difference]: Finished difference Result 387 states and 611 transitions. [2019-09-09 05:44:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:47,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-09 05:44:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:47,911 INFO L225 Difference]: With dead ends: 387 [2019-09-09 05:44:47,911 INFO L226 Difference]: Without dead ends: 387 [2019-09-09 05:44:47,912 INFO L628 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-09-09 05:44:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-09 05:44:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-09 05:44:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-09 05:44:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2019-09-09 05:44:47,922 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 111 [2019-09-09 05:44:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:47,922 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2019-09-09 05:44:47,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2019-09-09 05:44:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:44:47,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:47,925 INFO L399 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-09-09 05:44:47,925 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1449286990, now seen corresponding path program 1 times [2019-09-09 05:44:47,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:47,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:47,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:47,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:47,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-09 05:44:47,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:47,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:47,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:47,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:47,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:47,980 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2019-09-09 05:44:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:48,017 INFO L93 Difference]: Finished difference Result 751 states and 1191 transitions. [2019-09-09 05:44:48,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:48,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-09 05:44:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:48,022 INFO L225 Difference]: With dead ends: 751 [2019-09-09 05:44:48,023 INFO L226 Difference]: Without dead ends: 751 [2019-09-09 05:44:48,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-09-09 05:44:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2019-09-09 05:44:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-09 05:44:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1191 transitions. [2019-09-09 05:44:48,041 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1191 transitions. Word has length 126 [2019-09-09 05:44:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:48,041 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1191 transitions. [2019-09-09 05:44:48,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1191 transitions. [2019-09-09 05:44:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:44:48,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:48,044 INFO L399 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-09-09 05:44:48,044 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:48,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:48,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1360581389, now seen corresponding path program 1 times [2019-09-09 05:44:48,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:48,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:48,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:48,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:48,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:48,055 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:48,055 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:48,056 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:48,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:48,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:44:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:48,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-09 05:44:48,112 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [93], [98], [103], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:48,169 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:48,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:48,339 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:44:48,341 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 93 root evaluator evaluations with a maximum evaluation depth of 4. Performed 93 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 84 variables. [2019-09-09 05:44:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:48,346 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:44:48,497 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 84.85% of their original sizes. [2019-09-09 05:44:48,497 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:44:48,586 INFO L420 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2019-09-09 05:44:48,587 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:44:48,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:48,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-09 05:44:48,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:48,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 05:44:48,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 05:44:48,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:44:48,589 INFO L87 Difference]: Start difference. First operand 751 states and 1191 transitions. Second operand 10 states. [2019-09-09 05:44:49,327 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:49,571 INFO L93 Difference]: Finished difference Result 764 states and 1204 transitions. [2019-09-09 05:44:49,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:44:49,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-09-09 05:44:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:49,576 INFO L225 Difference]: With dead ends: 764 [2019-09-09 05:44:49,576 INFO L226 Difference]: Without dead ends: 764 [2019-09-09 05:44:49,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:44:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-09 05:44:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-09-09 05:44:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-09-09 05:44:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1204 transitions. [2019-09-09 05:44:49,595 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1204 transitions. Word has length 127 [2019-09-09 05:44:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:49,595 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 1204 transitions. [2019-09-09 05:44:49,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 05:44:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1204 transitions. [2019-09-09 05:44:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:44:49,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:49,599 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:44:49,599 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1941520082, now seen corresponding path program 1 times [2019-09-09 05:44:49,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:49,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:49,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:49,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:49,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-09 05:44:49,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:49,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:49,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:49,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:49,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:49,637 INFO L87 Difference]: Start difference. First operand 764 states and 1204 transitions. Second operand 3 states. [2019-09-09 05:44:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:49,780 INFO L93 Difference]: Finished difference Result 772 states and 1198 transitions. [2019-09-09 05:44:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:49,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-09 05:44:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:49,784 INFO L225 Difference]: With dead ends: 772 [2019-09-09 05:44:49,784 INFO L226 Difference]: Without dead ends: 772 [2019-09-09 05:44:49,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-09 05:44:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 764. [2019-09-09 05:44:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-09-09 05:44:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1186 transitions. [2019-09-09 05:44:49,800 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1186 transitions. Word has length 143 [2019-09-09 05:44:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:49,801 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 1186 transitions. [2019-09-09 05:44:49,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1186 transitions. [2019-09-09 05:44:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:44:49,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:49,804 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:44:49,804 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1426466207, now seen corresponding path program 1 times [2019-09-09 05:44:49,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:49,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:49,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:49,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:49,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:49,815 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:49,815 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:49,815 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) [2019-09-09 05:44:49,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:49,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:49,887 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2019-09-09 05:44:49,888 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:49,907 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:49,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:50,261 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:50,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:50,332 INFO L272 AbstractInterpreter]: Visited 73 different actions 308 times. Merged at 57 different actions 218 times. Widened at 3 different actions 4 times. Performed 725 root evaluator evaluations with a maximum evaluation depth of 8. Performed 725 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 12 fixpoints after 9 different actions. Largest state had 86 variables. [2019-09-09 05:44:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:50,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:50,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:50,333 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-09-09 05:44:50,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:50,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:50,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:44:50,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:44:50,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:44:50,535 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:50,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:44:50,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:50,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:50,538 INFO L87 Difference]: Start difference. First operand 764 states and 1186 transitions. Second operand 3 states. [2019-09-09 05:44:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:50,582 INFO L93 Difference]: Finished difference Result 1132 states and 1762 transitions. [2019-09-09 05:44:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:50,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-09 05:44:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:50,588 INFO L225 Difference]: With dead ends: 1132 [2019-09-09 05:44:50,588 INFO L226 Difference]: Without dead ends: 1132 [2019-09-09 05:44:50,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-09-09 05:44:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2019-09-09 05:44:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-09-09 05:44:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1762 transitions. [2019-09-09 05:44:50,624 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1762 transitions. Word has length 164 [2019-09-09 05:44:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:50,624 INFO L475 AbstractCegarLoop]: Abstraction has 1132 states and 1762 transitions. [2019-09-09 05:44:50,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1762 transitions. [2019-09-09 05:44:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-09 05:44:50,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:50,631 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:44:50,631 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:50,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash -391989381, now seen corresponding path program 1 times [2019-09-09 05:44:50,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:50,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-09 05:44:50,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:50,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:50,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:50,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:50,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:50,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:50,747 INFO L87 Difference]: Start difference. First operand 1132 states and 1762 transitions. Second operand 3 states. [2019-09-09 05:44:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:50,969 INFO L93 Difference]: Finished difference Result 1159 states and 1741 transitions. [2019-09-09 05:44:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:50,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-09 05:44:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:50,977 INFO L225 Difference]: With dead ends: 1159 [2019-09-09 05:44:50,978 INFO L226 Difference]: Without dead ends: 1159 [2019-09-09 05:44:50,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-09-09 05:44:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1132. [2019-09-09 05:44:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-09-09 05:44:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1708 transitions. [2019-09-09 05:44:51,015 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1708 transitions. Word has length 204 [2019-09-09 05:44:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:51,016 INFO L475 AbstractCegarLoop]: Abstraction has 1132 states and 1708 transitions. [2019-09-09 05:44:51,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1708 transitions. [2019-09-09 05:44:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-09 05:44:51,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:51,023 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:51,023 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:51,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -945704107, now seen corresponding path program 1 times [2019-09-09 05:44:51,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:51,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:51,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:51,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:51,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-09 05:44:51,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:51,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:51,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:51,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:51,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:51,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:51,112 INFO L87 Difference]: Start difference. First operand 1132 states and 1708 transitions. Second operand 3 states. [2019-09-09 05:44:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:51,288 INFO L93 Difference]: Finished difference Result 1170 states and 1710 transitions. [2019-09-09 05:44:51,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:51,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-09 05:44:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:51,294 INFO L225 Difference]: With dead ends: 1170 [2019-09-09 05:44:51,294 INFO L226 Difference]: Without dead ends: 1170 [2019-09-09 05:44:51,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-09 05:44:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1132. [2019-09-09 05:44:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-09-09 05:44:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1666 transitions. [2019-09-09 05:44:51,322 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1666 transitions. Word has length 217 [2019-09-09 05:44:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:51,322 INFO L475 AbstractCegarLoop]: Abstraction has 1132 states and 1666 transitions. [2019-09-09 05:44:51,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1666 transitions. [2019-09-09 05:44:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-09 05:44:51,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:51,328 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-09-09 05:44:51,329 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1110401752, now seen corresponding path program 1 times [2019-09-09 05:44:51,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:51,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:51,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:51,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:51,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:51,349 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:51,349 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:51,350 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:44:51,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:51,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:51,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2019-09-09 05:44:51,422 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:51,427 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:51,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:51,610 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:51,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:51,822 INFO L272 AbstractInterpreter]: Visited 78 different actions 411 times. Merged at 67 different actions 306 times. Widened at 6 different actions 9 times. Performed 972 root evaluator evaluations with a maximum evaluation depth of 8. Performed 972 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 26 fixpoints after 15 different actions. Largest state had 86 variables. [2019-09-09 05:44:51,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:51,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:51,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:51,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:44:51,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:51,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:51,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:51,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-09 05:44:52,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:44:52,132 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:52,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:44:52,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:52,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:52,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:52,142 INFO L87 Difference]: Start difference. First operand 1132 states and 1666 transitions. Second operand 3 states. [2019-09-09 05:44:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:52,171 INFO L93 Difference]: Finished difference Result 2226 states and 3281 transitions. [2019-09-09 05:44:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:52,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-09 05:44:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:52,184 INFO L225 Difference]: With dead ends: 2226 [2019-09-09 05:44:52,184 INFO L226 Difference]: Without dead ends: 2226 [2019-09-09 05:44:52,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2019-09-09 05:44:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2224. [2019-09-09 05:44:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2019-09-09 05:44:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3280 transitions. [2019-09-09 05:44:52,273 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3280 transitions. Word has length 246 [2019-09-09 05:44:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:52,273 INFO L475 AbstractCegarLoop]: Abstraction has 2224 states and 3280 transitions. [2019-09-09 05:44:52,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3280 transitions. [2019-09-09 05:44:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-09 05:44:52,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:52,281 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-09-09 05:44:52,282 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1423055184, now seen corresponding path program 1 times [2019-09-09 05:44:52,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:52,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:52,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:52,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:52,300 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:52,300 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:52,300 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:44:52,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:52,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:52,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2019-09-09 05:44:52,371 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [287], [293], [295], [298], [300], [306], [309], [313], [472], [475], [483], [486], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:52,383 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:52,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:52,568 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:52,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:52,789 INFO L272 AbstractInterpreter]: Visited 80 different actions 578 times. Merged at 68 different actions 447 times. Widened at 10 different actions 24 times. Performed 1420 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 52 fixpoints after 15 different actions. Largest state had 86 variables. [2019-09-09 05:44:52,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:52,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:52,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:52,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:52,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:52,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:52,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:52,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-09 05:44:52,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-09 05:44:53,036 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:53,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:44:53,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:53,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:53,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:53,039 INFO L87 Difference]: Start difference. First operand 2224 states and 3280 transitions. Second operand 3 states. [2019-09-09 05:44:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:53,182 INFO L93 Difference]: Finished difference Result 2224 states and 3214 transitions. [2019-09-09 05:44:53,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:53,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-09-09 05:44:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:53,192 INFO L225 Difference]: With dead ends: 2224 [2019-09-09 05:44:53,193 INFO L226 Difference]: Without dead ends: 2224 [2019-09-09 05:44:53,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2019-09-09 05:44:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2224. [2019-09-09 05:44:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2019-09-09 05:44:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3214 transitions. [2019-09-09 05:44:53,236 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3214 transitions. Word has length 283 [2019-09-09 05:44:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:53,236 INFO L475 AbstractCegarLoop]: Abstraction has 2224 states and 3214 transitions. [2019-09-09 05:44:53,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3214 transitions. [2019-09-09 05:44:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-09 05:44:53,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:53,246 INFO L399 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-09-09 05:44:53,246 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash 464693141, now seen corresponding path program 1 times [2019-09-09 05:44:53,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:53,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:53,263 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:53,263 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:53,263 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:44:53,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:53,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:44:53,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2019-09-09 05:44:53,330 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [287], [293], [295], [298], [300], [306], [309], [313], [436], [438], [472], [475], [483], [486], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:53,331 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:53,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:53,464 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:53,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:53,659 INFO L272 AbstractInterpreter]: Visited 83 different actions 551 times. Merged at 71 different actions 415 times. Widened at 9 different actions 21 times. Performed 1345 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1345 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 50 fixpoints after 17 different actions. Largest state had 86 variables. [2019-09-09 05:44:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:53,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:53,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:53,660 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:53,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:53,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:53,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:44:53,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-09 05:44:53,885 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:44:53,951 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:53,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-09-09 05:44:53,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:53,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:53,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:53,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:44:53,956 INFO L87 Difference]: Start difference. First operand 2224 states and 3214 transitions. Second operand 3 states. [2019-09-09 05:44:54,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:54,155 INFO L93 Difference]: Finished difference Result 2458 states and 3472 transitions. [2019-09-09 05:44:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:54,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-09 05:44:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:54,164 INFO L225 Difference]: With dead ends: 2458 [2019-09-09 05:44:54,164 INFO L226 Difference]: Without dead ends: 1481 [2019-09-09 05:44:54,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:44:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-09-09 05:44:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-09-09 05:44:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-09-09 05:44:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2109 transitions. [2019-09-09 05:44:54,197 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2109 transitions. Word has length 311 [2019-09-09 05:44:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:54,197 INFO L475 AbstractCegarLoop]: Abstraction has 1481 states and 2109 transitions. [2019-09-09 05:44:54,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2109 transitions. [2019-09-09 05:44:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-09 05:44:54,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:54,204 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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-09-09 05:44:54,204 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash -60637526, now seen corresponding path program 1 times [2019-09-09 05:44:54,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:54,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:54,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:54,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-09-09 05:44:54,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:54,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:54,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:54,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:54,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:54,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:54,308 INFO L87 Difference]: Start difference. First operand 1481 states and 2109 transitions. Second operand 3 states. [2019-09-09 05:44:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:54,432 INFO L93 Difference]: Finished difference Result 1562 states and 2209 transitions. [2019-09-09 05:44:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:54,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-09 05:44:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:54,440 INFO L225 Difference]: With dead ends: 1562 [2019-09-09 05:44:54,440 INFO L226 Difference]: Without dead ends: 1562 [2019-09-09 05:44:54,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-09-09 05:44:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1550. [2019-09-09 05:44:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-09 05:44:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2193 transitions. [2019-09-09 05:44:54,468 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2193 transitions. Word has length 312 [2019-09-09 05:44:54,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:54,469 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2193 transitions. [2019-09-09 05:44:54,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2193 transitions. [2019-09-09 05:44:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-09 05:44:54,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:54,476 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-09 05:44:54,476 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1485741080, now seen corresponding path program 1 times [2019-09-09 05:44:54,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:54,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:54,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-09-09 05:44:54,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:54,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:54,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:54,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:54,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:54,564 INFO L87 Difference]: Start difference. First operand 1550 states and 2193 transitions. Second operand 3 states. [2019-09-09 05:44:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:54,682 INFO L93 Difference]: Finished difference Result 1698 states and 2393 transitions. [2019-09-09 05:44:54,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:54,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-09 05:44:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:54,690 INFO L225 Difference]: With dead ends: 1698 [2019-09-09 05:44:54,690 INFO L226 Difference]: Without dead ends: 1698 [2019-09-09 05:44:54,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-09 05:44:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1650. [2019-09-09 05:44:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2019-09-09 05:44:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2313 transitions. [2019-09-09 05:44:54,718 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2313 transitions. Word has length 332 [2019-09-09 05:44:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:54,718 INFO L475 AbstractCegarLoop]: Abstraction has 1650 states and 2313 transitions. [2019-09-09 05:44:54,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2313 transitions. [2019-09-09 05:44:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-09 05:44:54,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:54,731 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-09 05:44:54,731 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:54,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash 432297452, now seen corresponding path program 1 times [2019-09-09 05:44:54,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:54,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:54,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:54,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:54,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-09-09 05:44:54,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:54,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:54,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:54,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:54,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:54,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:54,904 INFO L87 Difference]: Start difference. First operand 1650 states and 2313 transitions. Second operand 3 states. [2019-09-09 05:44:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:55,034 INFO L93 Difference]: Finished difference Result 1678 states and 2321 transitions. [2019-09-09 05:44:55,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:55,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-09-09 05:44:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:55,042 INFO L225 Difference]: With dead ends: 1678 [2019-09-09 05:44:55,043 INFO L226 Difference]: Without dead ends: 1678 [2019-09-09 05:44:55,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-09-09 05:44:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1650. [2019-09-09 05:44:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2019-09-09 05:44:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2273 transitions. [2019-09-09 05:44:55,070 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2273 transitions. Word has length 358 [2019-09-09 05:44:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:55,070 INFO L475 AbstractCegarLoop]: Abstraction has 1650 states and 2273 transitions. [2019-09-09 05:44:55,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2273 transitions. [2019-09-09 05:44:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-09 05:44:55,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:55,079 INFO L399 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] [2019-09-09 05:44:55,079 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash 222053756, now seen corresponding path program 1 times [2019-09-09 05:44:55,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:55,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:55,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:55,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:44:55,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:55,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:44:55,223 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2019-09-09 05:44:55,224 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [311], [313], [317], [326], [328], [331], [337], [366], [371], [381], [385], [396], [407], [409], [414], [436], [438], [472], [475], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [530], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:55,239 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:55,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:55,299 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:55,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:55,786 INFO L272 AbstractInterpreter]: Visited 97 different actions 938 times. Merged at 78 different actions 736 times. Widened at 16 different actions 75 times. Performed 2123 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2123 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 78 fixpoints after 17 different actions. Largest state had 88 variables. [2019-09-09 05:44:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:55,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:55,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:55,787 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:44:55,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:55,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:55,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:55,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:44:55,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:44:56,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:44:56,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:44:56,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:44:56,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:44:56,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:44:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:56,147 INFO L87 Difference]: Start difference. First operand 1650 states and 2273 transitions. Second operand 4 states. [2019-09-09 05:44:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:56,481 INFO L93 Difference]: Finished difference Result 3214 states and 4318 transitions. [2019-09-09 05:44:56,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:56,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2019-09-09 05:44:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:56,495 INFO L225 Difference]: With dead ends: 3214 [2019-09-09 05:44:56,495 INFO L226 Difference]: Without dead ends: 3118 [2019-09-09 05:44:56,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:44:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3118 states. [2019-09-09 05:44:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3118 to 1735. [2019-09-09 05:44:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-09 05:44:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2368 transitions. [2019-09-09 05:44:56,531 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2368 transitions. Word has length 375 [2019-09-09 05:44:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:56,532 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2368 transitions. [2019-09-09 05:44:56,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:44:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2368 transitions. [2019-09-09 05:44:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-09-09 05:44:56,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:56,542 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-09 05:44:56,543 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1893965958, now seen corresponding path program 1 times [2019-09-09 05:44:56,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:56,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:56,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:56,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:56,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-09-09 05:44:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:56,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:56,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:56,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:56,686 INFO L87 Difference]: Start difference. First operand 1735 states and 2368 transitions. Second operand 3 states. [2019-09-09 05:44:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:56,819 INFO L93 Difference]: Finished difference Result 1743 states and 2336 transitions. [2019-09-09 05:44:56,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:56,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-09-09 05:44:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:56,827 INFO L225 Difference]: With dead ends: 1743 [2019-09-09 05:44:56,827 INFO L226 Difference]: Without dead ends: 1743 [2019-09-09 05:44:56,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2019-09-09 05:44:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1735. [2019-09-09 05:44:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-09 05:44:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2328 transitions. [2019-09-09 05:44:56,851 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2328 transitions. Word has length 443 [2019-09-09 05:44:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:56,852 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2328 transitions. [2019-09-09 05:44:56,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2328 transitions. [2019-09-09 05:44:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-09 05:44:56,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:56,864 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:56,864 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash 756608049, now seen corresponding path program 1 times [2019-09-09 05:44:56,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:56,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-09-09 05:44:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:57,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:57,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:57,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:57,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:57,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:57,064 INFO L87 Difference]: Start difference. First operand 1735 states and 2328 transitions. Second operand 3 states. [2019-09-09 05:44:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:57,195 INFO L93 Difference]: Finished difference Result 1879 states and 2492 transitions. [2019-09-09 05:44:57,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:57,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-09-09 05:44:57,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:57,202 INFO L225 Difference]: With dead ends: 1879 [2019-09-09 05:44:57,202 INFO L226 Difference]: Without dead ends: 1879 [2019-09-09 05:44:57,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-09-09 05:44:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1871. [2019-09-09 05:44:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2019-09-09 05:44:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2484 transitions. [2019-09-09 05:44:57,228 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2484 transitions. Word has length 475 [2019-09-09 05:44:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:57,229 INFO L475 AbstractCegarLoop]: Abstraction has 1871 states and 2484 transitions. [2019-09-09 05:44:57,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2484 transitions. [2019-09-09 05:44:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-09-09 05:44:57,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:57,243 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:57,243 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash -10886553, now seen corresponding path program 1 times [2019-09-09 05:44:57,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:57,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:57,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:57,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-09-09 05:44:57,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:57,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:57,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:57,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:57,537 INFO L87 Difference]: Start difference. First operand 1871 states and 2484 transitions. Second operand 3 states. [2019-09-09 05:44:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:57,734 INFO L93 Difference]: Finished difference Result 2023 states and 2656 transitions. [2019-09-09 05:44:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:57,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-09-09 05:44:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:57,741 INFO L225 Difference]: With dead ends: 2023 [2019-09-09 05:44:57,741 INFO L226 Difference]: Without dead ends: 2023 [2019-09-09 05:44:57,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-09-09 05:44:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2015. [2019-09-09 05:44:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2015 states. [2019-09-09 05:44:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2648 transitions. [2019-09-09 05:44:57,770 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2648 transitions. Word has length 537 [2019-09-09 05:44:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:57,770 INFO L475 AbstractCegarLoop]: Abstraction has 2015 states and 2648 transitions. [2019-09-09 05:44:57,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2648 transitions. [2019-09-09 05:44:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-09-09 05:44:57,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:57,807 INFO L399 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] [2019-09-09 05:44:57,808 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1755141137, now seen corresponding path program 1 times [2019-09-09 05:44:57,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:57,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:57,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:44:58,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:58,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:44:58,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 604 with the following transitions: [2019-09-09 05:44:58,161 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [311], [313], [317], [326], [328], [331], [337], [366], [371], [381], [385], [396], [407], [409], [414], [436], [438], [440], [445], [450], [455], [458], [463], [465], [470], [472], [475], [477], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [530], [532], [586], [588], [601], [606], [607], [608], [610] [2019-09-09 05:44:58,163 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:58,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:58,208 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:58,596 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:58,597 INFO L272 AbstractInterpreter]: Visited 109 different actions 945 times. Merged at 86 different actions 702 times. Widened at 16 different actions 64 times. Performed 2198 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 94 fixpoints after 20 different actions. Largest state had 93 variables. [2019-09-09 05:44:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:58,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:58,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:58,598 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:58,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:58,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:58,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:58,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:44:58,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:44:59,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:44:59,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:44:59,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:44:59,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:44:59,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:44:59,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:59,164 INFO L87 Difference]: Start difference. First operand 2015 states and 2648 transitions. Second operand 4 states. [2019-09-09 05:44:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:59,339 INFO L93 Difference]: Finished difference Result 686 states and 861 transitions. [2019-09-09 05:44:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:44:59,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-09-09 05:44:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:59,342 INFO L225 Difference]: With dead ends: 686 [2019-09-09 05:44:59,342 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:44:59,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:44:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:44:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:44:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:44:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:44:59,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-09-09 05:44:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:59,345 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:44:59,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:44:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:44:59,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:44:59,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:44:59 BoogieIcfgContainer [2019-09-09 05:44:59,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:44:59,356 INFO L168 Benchmark]: Toolchain (without parser) took 18112.62 ms. Allocated memory was 139.5 MB in the beginning and 787.5 MB in the end (delta: 648.0 MB). Free memory was 95.1 MB in the beginning and 636.4 MB in the end (delta: -541.2 MB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:59,357 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 114.0 MB in the beginning and 113.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-09 05:44:59,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.58 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 94.9 MB in the beginning and 176.9 MB in the end (delta: -81.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:59,360 INFO L168 Benchmark]: Boogie Preprocessor took 54.53 ms. Allocated memory is still 203.4 MB. Free memory was 176.9 MB in the beginning and 174.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:59,363 INFO L168 Benchmark]: RCFGBuilder took 797.59 ms. Allocated memory is still 203.4 MB. Free memory was 174.1 MB in the beginning and 126.7 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:59,365 INFO L168 Benchmark]: TraceAbstraction took 16777.83 ms. Allocated memory was 203.4 MB in the beginning and 787.5 MB in the end (delta: 584.1 MB). Free memory was 126.2 MB in the beginning and 636.4 MB in the end (delta: -510.2 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:59,370 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 114.0 MB in the beginning and 113.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 478.58 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 94.9 MB in the beginning and 176.9 MB in the end (delta: -81.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.53 ms. Allocated memory is still 203.4 MB. Free memory was 176.9 MB in the beginning and 174.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.59 ms. Allocated memory is still 203.4 MB. Free memory was 174.1 MB in the beginning and 126.7 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16777.83 ms. Allocated memory was 203.4 MB in the beginning and 787.5 MB in the end (delta: 584.1 MB). Free memory was 126.2 MB in the beginning and 636.4 MB in the end (delta: -510.2 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: 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, 146 locations, 1 error locations. SAFE Result, 16.7s OverallTime, 31 OverallIterations, 19 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5263 SDtfs, 6689 SDslu, 4710 SDs, 0 SdLazy, 4258 SolverSat, 913 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4212 GetRequests, 4120 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2224occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.8s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.5625850340136055 AbsIntWeakeningRatio, 0.5634920634920635 AbsIntAvgWeakeningVarsNumRemoved, -1.8095238095238095 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 1618 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 8510 NumberOfCodeBlocks, 8510 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 9323 ConstructedInterpolants, 0 QuantifiedInterpolants, 4158813 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3490 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 32808/32964 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...