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/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:56,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:56,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:56,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:56,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:56,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:56,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:56,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:56,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:56,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:56,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:56,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:56,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:56,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:56,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:56,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:56,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:56,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:56,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:56,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:56,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:56,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:56,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:56,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:56,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:56,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:56,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:56,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:56,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:56,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:56,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:56,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:56,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:56,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:56,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:56,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:56,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:56,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:56,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:56,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:56,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:56,451 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-20 13:26:56,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:56,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:56,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:56,476 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:56,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:56,477 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:56,477 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:56,477 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:56,477 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:56,478 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:56,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:56,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:56,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:56,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:56,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:56,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:56,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:56,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:56,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:56,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:56,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:56,481 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:56,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:56,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:56,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:56,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:56,482 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:56,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:56,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:56,482 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:56,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:56,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:56,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:56,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:56,536 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:56,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-09-20 13:26:56,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620c5f4c0/509d42cb8b6048c19dd43bd29b126d23/FLAG915f87571 [2019-09-20 13:26:57,135 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:57,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-09-20 13:26:57,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620c5f4c0/509d42cb8b6048c19dd43bd29b126d23/FLAG915f87571 [2019-09-20 13:26:57,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620c5f4c0/509d42cb8b6048c19dd43bd29b126d23 [2019-09-20 13:26:57,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:57,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:57,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:57,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:57,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:57,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:57,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158aca92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57, skipping insertion in model container [2019-09-20 13:26:57,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:57,514 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:57,542 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:57,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:57,798 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:57,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:57,982 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:57,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57 WrapperNode [2019-09-20 13:26:57,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:57,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:57,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:57,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:57,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:58,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:58,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:58,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:58,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:58,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:58,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (1/1) ... [2019-09-20 13:26:58,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:58,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:58,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:58,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:58,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (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-20 13:26:58,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:58,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:58,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:58,432 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:58,432 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:58,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:58 BoogieIcfgContainer [2019-09-20 13:26:58,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:58,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:58,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:58,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:58,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:57" (1/3) ... [2019-09-20 13:26:58,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c54ca0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:58, skipping insertion in model container [2019-09-20 13:26:58,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:57" (2/3) ... [2019-09-20 13:26:58,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c54ca0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:58, skipping insertion in model container [2019-09-20 13:26:58,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:58" (3/3) ... [2019-09-20 13:26:58,442 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-09-20 13:26:58,453 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:58,461 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:58,479 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:58,507 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:58,507 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:58,507 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:58,507 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:58,507 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:58,508 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:58,508 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:58,508 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-20 13:26:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:58,537 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,539 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:58,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-09-20 13:26:58,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,740 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-20 13:26:58,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,765 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-09-20 13:26:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,825 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-09-20 13:26:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,843 INFO L225 Difference]: With dead ends: 68 [2019-09-20 13:26:58,843 INFO L226 Difference]: Without dead ends: 60 [2019-09-20 13:26:58,846 INFO L636 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-20 13:26:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-20 13:26:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-09-20 13:26:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 13:26:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-09-20 13:26:58,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-09-20 13:26:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,892 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-09-20 13:26:58,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-09-20 13:26:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:58,893 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,893 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:58,894 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-09-20 13:26:58,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,961 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-20 13:26:58,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,967 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-09-20 13:26:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,992 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2019-09-20 13:26:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,994 INFO L225 Difference]: With dead ends: 60 [2019-09-20 13:26:58,995 INFO L226 Difference]: Without dead ends: 60 [2019-09-20 13:26:58,996 INFO L636 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-20 13:26:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-20 13:26:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-09-20 13:26:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 13:26:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-09-20 13:26:59,005 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-09-20 13:26:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,006 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-09-20 13:26:59,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-09-20 13:26:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:59,007 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,008 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,008 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,008 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-09-20 13:26:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,065 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-20 13:26:59,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,069 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-09-20 13:26:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,105 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2019-09-20 13:26:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,107 INFO L225 Difference]: With dead ends: 63 [2019-09-20 13:26:59,107 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 13:26:59,108 INFO L636 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-20 13:26:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 13:26:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-20 13:26:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-20 13:26:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-09-20 13:26:59,118 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-09-20 13:26:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,119 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-09-20 13:26:59,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-09-20 13:26:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:59,120 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,120 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,121 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-09-20 13:26:59,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,167 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-20 13:26:59,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,170 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-09-20 13:26:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,200 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2019-09-20 13:26:59,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,204 INFO L225 Difference]: With dead ends: 110 [2019-09-20 13:26:59,204 INFO L226 Difference]: Without dead ends: 110 [2019-09-20 13:26:59,205 INFO L636 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-20 13:26:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-20 13:26:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-09-20 13:26:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-20 13:26:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-09-20 13:26:59,215 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-09-20 13:26:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,216 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-09-20 13:26:59,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-09-20 13:26:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:59,217 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,217 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,217 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-09-20 13:26:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,283 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-20 13:26:59,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,285 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-09-20 13:26:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,309 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2019-09-20 13:26:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,311 INFO L225 Difference]: With dead ends: 112 [2019-09-20 13:26:59,312 INFO L226 Difference]: Without dead ends: 112 [2019-09-20 13:26:59,312 INFO L636 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-20 13:26:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-20 13:26:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-09-20 13:26:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-20 13:26:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-09-20 13:26:59,331 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-09-20 13:26:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,332 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-09-20 13:26:59,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-09-20 13:26:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:59,335 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,336 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,336 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-09-20 13:26:59,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,375 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-20 13:26:59,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,377 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-09-20 13:26:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,394 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-09-20 13:26:59,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,396 INFO L225 Difference]: With dead ends: 114 [2019-09-20 13:26:59,397 INFO L226 Difference]: Without dead ends: 114 [2019-09-20 13:26:59,397 INFO L636 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-20 13:26:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-20 13:26:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-20 13:26:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-20 13:26:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-09-20 13:26:59,407 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-09-20 13:26:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,407 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-09-20 13:26:59,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-09-20 13:26:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:59,409 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,409 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,410 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-09-20 13:26:59,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:59,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,488 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-09-20 13:26:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,502 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2019-09-20 13:26:59,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,505 INFO L225 Difference]: With dead ends: 202 [2019-09-20 13:26:59,505 INFO L226 Difference]: Without dead ends: 202 [2019-09-20 13:26:59,505 INFO L636 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-20 13:26:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-20 13:26:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-09-20 13:26:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:26:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-09-20 13:26:59,517 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-09-20 13:26:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,517 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-09-20 13:26:59,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-09-20 13:26:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:59,519 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,519 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,519 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-09-20 13:26:59,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,557 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-20 13:26:59,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,559 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-09-20 13:26:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,576 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2019-09-20 13:26:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,579 INFO L225 Difference]: With dead ends: 210 [2019-09-20 13:26:59,579 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:26:59,579 INFO L636 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-20 13:26:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:26:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-09-20 13:26:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-20 13:26:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-09-20 13:26:59,592 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-09-20 13:26:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,592 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-09-20 13:26:59,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-09-20 13:26:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:59,595 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,595 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,595 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,596 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-09-20 13:26:59,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,640 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-20 13:26:59,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,642 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-09-20 13:26:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,658 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2019-09-20 13:26:59,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,660 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:26:59,661 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:26:59,661 INFO L636 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-20 13:26:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:26:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-09-20 13:26:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-20 13:26:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-09-20 13:26:59,685 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-09-20 13:26:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,685 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-09-20 13:26:59,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-09-20 13:26:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:59,690 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,690 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,691 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-09-20 13:26:59,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,745 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-20 13:26:59,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,747 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-09-20 13:26:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,761 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2019-09-20 13:26:59,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,767 INFO L225 Difference]: With dead ends: 378 [2019-09-20 13:26:59,767 INFO L226 Difference]: Without dead ends: 378 [2019-09-20 13:26:59,767 INFO L636 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-20 13:26:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-20 13:26:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-09-20 13:26:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-20 13:26:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-09-20 13:26:59,782 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-09-20 13:26:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,785 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-09-20 13:26:59,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-09-20 13:26:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:59,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,790 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,791 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,791 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-09-20 13:26:59,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,829 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-20 13:26:59,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,831 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-09-20 13:26:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,852 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2019-09-20 13:26:59,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,856 INFO L225 Difference]: With dead ends: 402 [2019-09-20 13:26:59,856 INFO L226 Difference]: Without dead ends: 402 [2019-09-20 13:26:59,856 INFO L636 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-20 13:26:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-20 13:26:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-09-20 13:26:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-20 13:26:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-09-20 13:26:59,868 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-09-20 13:26:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,869 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-09-20 13:26:59,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-09-20 13:26:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:59,870 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,870 INFO L407 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] [2019-09-20 13:26:59,870 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-09-20 13:26:59,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,892 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-20 13:26:59,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,894 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-09-20 13:26:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,909 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2019-09-20 13:26:59,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,912 INFO L225 Difference]: With dead ends: 410 [2019-09-20 13:26:59,913 INFO L226 Difference]: Without dead ends: 410 [2019-09-20 13:26:59,913 INFO L636 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-20 13:26:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-20 13:26:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-20 13:26:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-20 13:26:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-09-20 13:26:59,925 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-09-20 13:26:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,928 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-09-20 13:26:59,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-09-20 13:26:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:59,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,930 INFO L407 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] [2019-09-20 13:26:59,931 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-09-20 13:26:59,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,972 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-20 13:26:59,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,974 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-09-20 13:26:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,994 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2019-09-20 13:26:59,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,999 INFO L225 Difference]: With dead ends: 714 [2019-09-20 13:26:59,999 INFO L226 Difference]: Without dead ends: 714 [2019-09-20 13:27:00,000 INFO L636 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-20 13:27:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-20 13:27:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-09-20 13:27:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-20 13:27:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-09-20 13:27:00,018 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-09-20 13:27:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,018 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-09-20 13:27:00,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-09-20 13:27:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:27:00,020 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,021 INFO L407 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] [2019-09-20 13:27:00,022 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-09-20 13:27:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,060 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-20 13:27:00,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,064 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-09-20 13:27:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,085 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2019-09-20 13:27:00,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:27:00,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,090 INFO L225 Difference]: With dead ends: 778 [2019-09-20 13:27:00,091 INFO L226 Difference]: Without dead ends: 778 [2019-09-20 13:27:00,092 INFO L636 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-20 13:27:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-20 13:27:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-09-20 13:27:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-20 13:27:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-09-20 13:27:00,112 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-09-20 13:27:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,112 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-09-20 13:27:00,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-09-20 13:27:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:27:00,114 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,114 INFO L407 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] [2019-09-20 13:27:00,114 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-09-20 13:27:00,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,138 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-20 13:27:00,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,140 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-09-20 13:27:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,157 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2019-09-20 13:27:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:27:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,162 INFO L225 Difference]: With dead ends: 794 [2019-09-20 13:27:00,163 INFO L226 Difference]: Without dead ends: 794 [2019-09-20 13:27:00,165 INFO L636 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-20 13:27:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-09-20 13:27:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-09-20 13:27:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-09-20 13:27:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-09-20 13:27:00,186 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-09-20 13:27:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,186 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-09-20 13:27:00,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-09-20 13:27:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:27:00,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,188 INFO L407 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] [2019-09-20 13:27:00,188 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-09-20 13:27:00,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,219 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-20 13:27:00,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,222 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-09-20 13:27:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,241 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2019-09-20 13:27:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:27:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,248 INFO L225 Difference]: With dead ends: 1354 [2019-09-20 13:27:00,249 INFO L226 Difference]: Without dead ends: 1354 [2019-09-20 13:27:00,249 INFO L636 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-20 13:27:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-20 13:27:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-09-20 13:27:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-09-20 13:27:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-09-20 13:27:00,281 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-09-20 13:27:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,281 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-09-20 13:27:00,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-09-20 13:27:00,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:27:00,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,284 INFO L407 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] [2019-09-20 13:27:00,284 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-09-20 13:27:00,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,301 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-20 13:27:00,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,303 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-09-20 13:27:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,324 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2019-09-20 13:27:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:27:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,332 INFO L225 Difference]: With dead ends: 1514 [2019-09-20 13:27:00,332 INFO L226 Difference]: Without dead ends: 1514 [2019-09-20 13:27:00,333 INFO L636 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-20 13:27:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-09-20 13:27:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-09-20 13:27:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-09-20 13:27:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-09-20 13:27:00,374 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-09-20 13:27:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,374 INFO L475 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-09-20 13:27:00,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-09-20 13:27:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:27:00,377 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,377 INFO L407 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] [2019-09-20 13:27:00,378 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-09-20 13:27:00,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,402 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-20 13:27:00,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,404 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-09-20 13:27:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,428 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2019-09-20 13:27:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:27:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,437 INFO L225 Difference]: With dead ends: 1546 [2019-09-20 13:27:00,437 INFO L226 Difference]: Without dead ends: 1546 [2019-09-20 13:27:00,438 INFO L636 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-20 13:27:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-20 13:27:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-09-20 13:27:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-20 13:27:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-09-20 13:27:00,489 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-09-20 13:27:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,489 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-09-20 13:27:00,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-09-20 13:27:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:27:00,492 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,492 INFO L407 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] [2019-09-20 13:27:00,492 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-09-20 13:27:00,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,515 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-20 13:27:00,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,517 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-09-20 13:27:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,545 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2019-09-20 13:27:00,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:27:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,557 INFO L225 Difference]: With dead ends: 2570 [2019-09-20 13:27:00,558 INFO L226 Difference]: Without dead ends: 2570 [2019-09-20 13:27:00,559 INFO L636 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-20 13:27:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-09-20 13:27:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-09-20 13:27:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-09-20 13:27:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-09-20 13:27:00,610 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-09-20 13:27:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,610 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-09-20 13:27:00,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-09-20 13:27:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:27:00,615 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,615 INFO L407 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] [2019-09-20 13:27:00,615 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,615 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-09-20 13:27:00,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,638 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-20 13:27:00,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,639 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-09-20 13:27:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,672 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2019-09-20 13:27:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:27:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,690 INFO L225 Difference]: With dead ends: 2954 [2019-09-20 13:27:00,690 INFO L226 Difference]: Without dead ends: 2954 [2019-09-20 13:27:00,691 INFO L636 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-20 13:27:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-20 13:27:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-09-20 13:27:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-09-20 13:27:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-09-20 13:27:00,781 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-09-20 13:27:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,782 INFO L475 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-09-20 13:27:00,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-09-20 13:27:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:27:00,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,793 INFO L407 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] [2019-09-20 13:27:00,794 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-09-20 13:27:00,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,825 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-20 13:27:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,827 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-09-20 13:27:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,874 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2019-09-20 13:27:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:27:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,888 INFO L225 Difference]: With dead ends: 3018 [2019-09-20 13:27:00,888 INFO L226 Difference]: Without dead ends: 3018 [2019-09-20 13:27:00,889 INFO L636 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-20 13:27:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-09-20 13:27:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-09-20 13:27:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-20 13:27:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-09-20 13:27:00,972 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-09-20 13:27:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,972 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-09-20 13:27:00,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-09-20 13:27:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:27:00,980 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,980 INFO L407 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] [2019-09-20 13:27:00,980 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-09-20 13:27:00,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,009 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-20 13:27:01,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,011 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-09-20 13:27:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,062 INFO L93 Difference]: Finished difference Result 5768 states and 6278 transitions. [2019-09-20 13:27:01,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:27:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,080 INFO L225 Difference]: With dead ends: 5768 [2019-09-20 13:27:01,080 INFO L226 Difference]: Without dead ends: 3016 [2019-09-20 13:27:01,081 INFO L636 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-20 13:27:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-09-20 13:27:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-09-20 13:27:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-20 13:27:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-09-20 13:27:01,165 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-09-20 13:27:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,165 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-09-20 13:27:01,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-09-20 13:27:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:27:01,172 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:01,172 INFO L407 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] [2019-09-20 13:27:01,173 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:01,173 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-09-20 13:27:01,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,205 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-20 13:27:01,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,207 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-09-20 13:27:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,229 INFO L93 Difference]: Finished difference Result 3014 states and 3141 transitions. [2019-09-20 13:27:01,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:27:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,230 INFO L225 Difference]: With dead ends: 3014 [2019-09-20 13:27:01,231 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:01,231 INFO L636 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-20 13:27:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:01,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-20 13:27:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,233 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:01,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:01,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:01,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:01 BoogieIcfgContainer [2019-09-20 13:27:01,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:01,250 INFO L168 Benchmark]: Toolchain (without parser) took 3747.83 ms. Allocated memory was 140.0 MB in the beginning and 260.0 MB in the end (delta: 120.1 MB). Free memory was 87.2 MB in the beginning and 84.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 122.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:01,251 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:01,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.38 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 87.0 MB in the beginning and 179.3 MB in the end (delta: -92.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:01,253 INFO L168 Benchmark]: Boogie Preprocessor took 46.86 ms. Allocated memory is still 200.8 MB. Free memory was 179.3 MB in the beginning and 177.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:01,255 INFO L168 Benchmark]: RCFGBuilder took 401.87 ms. Allocated memory is still 200.8 MB. Free memory was 176.5 MB in the beginning and 159.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:01,258 INFO L168 Benchmark]: TraceAbstraction took 2806.84 ms. Allocated memory was 200.8 MB in the beginning and 260.0 MB in the end (delta: 59.2 MB). Free memory was 159.3 MB in the beginning and 84.8 MB in the end (delta: 74.5 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:01,268 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 487.38 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 87.0 MB in the beginning and 179.3 MB in the end (delta: -92.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.86 ms. Allocated memory is still 200.8 MB. Free memory was 179.3 MB in the beginning and 177.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 401.87 ms. Allocated memory is still 200.8 MB. Free memory was 176.5 MB in the beginning and 159.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2806.84 ms. Allocated memory was 200.8 MB in the beginning and 260.0 MB in the end (delta: 59.2 MB). Free memory was 159.3 MB in the beginning and 84.8 MB in the end (delta: 74.5 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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 3 procedures, 38 locations, 1 error locations. SAFE Result, 2.7s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...