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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:44,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:44,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:44,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:44,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:44,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:44,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:44,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:44,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:44,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:44,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:44,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:44,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:44,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:44,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:44,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:44,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:44,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:44,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:44,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:44,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:44,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:44,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:44,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:44,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:44,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:44,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:44,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:44,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:44,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:44,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:44,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:44,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:44,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:44,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:44,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:44,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:44,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:44,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:44,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:44,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:44,547 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-16 17:04:44,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:44,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:44,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:44,568 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:44,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:44,569 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:44,569 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:44,569 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:44,570 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:44,570 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:44,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:44,571 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:44,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:44,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:44,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:44,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:44,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:44,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:44,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:44,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:44,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:44,574 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:44,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:44,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:44,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:44,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:44,576 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:44,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:44,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:44,576 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:44,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:44,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:44,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:44,653 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:44,654 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:44,654 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-09-16 17:04:44,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b559216/c2573cbf1e4440668bd6e1d64b537b19/FLAG4acf0c757 [2019-09-16 17:04:45,188 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:45,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-09-16 17:04:45,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b559216/c2573cbf1e4440668bd6e1d64b537b19/FLAG4acf0c757 [2019-09-16 17:04:45,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b559216/c2573cbf1e4440668bd6e1d64b537b19 [2019-09-16 17:04:45,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:45,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:45,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:45,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:45,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:45,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f676bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45, skipping insertion in model container [2019-09-16 17:04:45,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:45,575 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:45,597 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:45,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:45,856 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:45,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:45,907 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:45,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45 WrapperNode [2019-09-16 17:04:45,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:45,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:45,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:45,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:46,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:46,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:46,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:46,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:46,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:46,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:46,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (1/1) ... [2019-09-16 17:04:46,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:46,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:46,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:46,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:46,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (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-16 17:04:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:46,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:46,388 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:46,388 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:46,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:46 BoogieIcfgContainer [2019-09-16 17:04:46,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:46,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:46,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:46,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:46,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:45" (1/3) ... [2019-09-16 17:04:46,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31461174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:46, skipping insertion in model container [2019-09-16 17:04:46,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:45" (2/3) ... [2019-09-16 17:04:46,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31461174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:46, skipping insertion in model container [2019-09-16 17:04:46,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:46" (3/3) ... [2019-09-16 17:04:46,409 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-09-16 17:04:46,424 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:46,432 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:46,461 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:46,490 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:46,491 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:46,491 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:46,491 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:46,491 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:46,492 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:46,492 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:46,493 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-16 17:04:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:04:46,516 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,517 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,520 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,526 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-09-16 17:04:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,691 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-16 17:04:46,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,712 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-09-16 17:04:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,770 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2019-09-16 17:04:46,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 17:04:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,783 INFO L225 Difference]: With dead ends: 56 [2019-09-16 17:04:46,783 INFO L226 Difference]: Without dead ends: 48 [2019-09-16 17:04:46,785 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-16 17:04:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-16 17:04:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-09-16 17:04:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-16 17:04:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-09-16 17:04:46,829 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-09-16 17:04:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,830 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-09-16 17:04:46,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-09-16 17:04:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:04:46,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,831 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,831 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-09-16 17:04:46,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,910 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-16 17:04:46,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,913 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-09-16 17:04:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,949 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2019-09-16 17:04:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 17:04:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,951 INFO L225 Difference]: With dead ends: 48 [2019-09-16 17:04:46,951 INFO L226 Difference]: Without dead ends: 48 [2019-09-16 17:04:46,953 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-16 17:04:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-16 17:04:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-16 17:04:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-16 17:04:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-09-16 17:04:46,967 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-09-16 17:04:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,968 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-09-16 17:04:46,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-09-16 17:04:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:04:46,970 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,970 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,970 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,971 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-09-16 17:04:46,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,029 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-16 17:04:47,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,031 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-09-16 17:04:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,058 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2019-09-16 17:04:47,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 17:04:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,060 INFO L225 Difference]: With dead ends: 51 [2019-09-16 17:04:47,060 INFO L226 Difference]: Without dead ends: 51 [2019-09-16 17:04:47,061 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-16 17:04:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-16 17:04:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-09-16 17:04:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-16 17:04:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-09-16 17:04:47,071 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-09-16 17:04:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,071 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-09-16 17:04:47,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-09-16 17:04:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:04:47,072 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,072 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:47,073 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,073 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-09-16 17:04:47,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,114 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-16 17:04:47,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,117 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-09-16 17:04:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,134 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2019-09-16 17:04:47,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 17:04:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,137 INFO L225 Difference]: With dead ends: 86 [2019-09-16 17:04:47,137 INFO L226 Difference]: Without dead ends: 86 [2019-09-16 17:04:47,137 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-16 17:04:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-16 17:04:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-09-16 17:04:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-16 17:04:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-09-16 17:04:47,147 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-09-16 17:04:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,147 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-09-16 17:04:47,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-09-16 17:04:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:04:47,149 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,149 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:47,149 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-09-16 17:04:47,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,200 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-16 17:04:47,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,202 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-09-16 17:04:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,224 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2019-09-16 17:04:47,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 17:04:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,226 INFO L225 Difference]: With dead ends: 88 [2019-09-16 17:04:47,226 INFO L226 Difference]: Without dead ends: 88 [2019-09-16 17:04:47,226 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-16 17:04:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-16 17:04:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-09-16 17:04:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-16 17:04:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-09-16 17:04:47,235 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-09-16 17:04:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,236 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-09-16 17:04:47,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-09-16 17:04:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:47,237 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,237 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-16 17:04:47,237 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-09-16 17:04:47,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,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-16 17:04:47,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,303 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-09-16 17:04:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,323 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2019-09-16 17:04:47,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,325 INFO L225 Difference]: With dead ends: 90 [2019-09-16 17:04:47,325 INFO L226 Difference]: Without dead ends: 90 [2019-09-16 17:04:47,326 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-16 17:04:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-16 17:04:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-16 17:04:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-16 17:04:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-09-16 17:04:47,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-09-16 17:04:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,334 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-09-16 17:04:47,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-09-16 17:04:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:47,336 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,336 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-16 17:04:47,336 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-09-16 17:04:47,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,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-16 17:04:47,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,377 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-09-16 17:04:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,399 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2019-09-16 17:04:47,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,401 INFO L225 Difference]: With dead ends: 154 [2019-09-16 17:04:47,401 INFO L226 Difference]: Without dead ends: 154 [2019-09-16 17:04:47,402 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-16 17:04:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-16 17:04:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-09-16 17:04:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-16 17:04:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-09-16 17:04:47,413 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-09-16 17:04:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,414 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-09-16 17:04:47,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-09-16 17:04:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:47,416 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,416 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-16 17:04:47,416 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-09-16 17:04:47,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,447 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-16 17:04:47,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,450 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-09-16 17:04:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,474 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2019-09-16 17:04:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,476 INFO L225 Difference]: With dead ends: 162 [2019-09-16 17:04:47,476 INFO L226 Difference]: Without dead ends: 162 [2019-09-16 17:04:47,477 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-16 17:04:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-16 17:04:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-16 17:04:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:04:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-09-16 17:04:47,488 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-09-16 17:04:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,489 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-09-16 17:04:47,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-09-16 17:04:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:47,491 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,491 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-16 17:04:47,492 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-09-16 17:04:47,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,517 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-16 17:04:47,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,520 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-09-16 17:04:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,541 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2019-09-16 17:04:47,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,543 INFO L225 Difference]: With dead ends: 166 [2019-09-16 17:04:47,543 INFO L226 Difference]: Without dead ends: 166 [2019-09-16 17:04:47,544 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-16 17:04:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-16 17:04:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-09-16 17:04:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-16 17:04:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-09-16 17:04:47,553 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-09-16 17:04:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,553 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-09-16 17:04:47,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-09-16 17:04:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:47,555 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,556 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-16 17:04:47,556 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-09-16 17:04:47,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,585 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-16 17:04:47,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,587 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-09-16 17:04:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,614 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-16 17:04:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,617 INFO L225 Difference]: With dead ends: 282 [2019-09-16 17:04:47,617 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 17:04:47,618 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-16 17:04:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 17:04:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-09-16 17:04:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-16 17:04:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-09-16 17:04:47,652 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-09-16 17:04:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,652 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-09-16 17:04:47,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-09-16 17:04:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:47,662 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,662 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-16 17:04:47,663 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-09-16 17:04:47,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,708 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-16 17:04:47,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,710 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-09-16 17:04:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,729 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2019-09-16 17:04:47,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,732 INFO L225 Difference]: With dead ends: 306 [2019-09-16 17:04:47,732 INFO L226 Difference]: Without dead ends: 306 [2019-09-16 17:04:47,733 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-16 17:04:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-16 17:04:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-16 17:04:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-16 17:04:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-09-16 17:04:47,742 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-09-16 17:04:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,743 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-09-16 17:04:47,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-09-16 17:04:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:47,745 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,745 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-16 17:04:47,745 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,746 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-09-16 17:04:47,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,773 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-16 17:04:47,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,777 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-09-16 17:04:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,792 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2019-09-16 17:04:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,797 INFO L225 Difference]: With dead ends: 314 [2019-09-16 17:04:47,798 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 17:04:47,798 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-16 17:04:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 17:04:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-09-16 17:04:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-16 17:04:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-09-16 17:04:47,808 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-09-16 17:04:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,808 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-09-16 17:04:47,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-09-16 17:04:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:47,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,810 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-16 17:04:47,811 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-09-16 17:04:47,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,863 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-16 17:04:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,866 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-09-16 17:04:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,884 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2019-09-16 17:04:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,888 INFO L225 Difference]: With dead ends: 522 [2019-09-16 17:04:47,888 INFO L226 Difference]: Without dead ends: 522 [2019-09-16 17:04:47,888 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-16 17:04:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-16 17:04:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-09-16 17:04:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-16 17:04:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-09-16 17:04:47,903 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-09-16 17:04:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,903 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-09-16 17:04:47,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-09-16 17:04:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:47,907 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,908 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-16 17:04:47,908 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-09-16 17:04:47,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,944 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-16 17:04:47,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,949 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-09-16 17:04:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,973 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2019-09-16 17:04:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,977 INFO L225 Difference]: With dead ends: 586 [2019-09-16 17:04:47,977 INFO L226 Difference]: Without dead ends: 586 [2019-09-16 17:04:47,978 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-16 17:04:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-16 17:04:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-09-16 17:04:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-16 17:04:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-09-16 17:04:47,993 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-09-16 17:04:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,993 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-09-16 17:04:47,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-09-16 17:04:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:47,996 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,996 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-16 17:04:47,996 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-09-16 17:04:47,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,038 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-16 17:04:48,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:48,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:48,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:48,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:48,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:48,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,040 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-09-16 17:04:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,056 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2019-09-16 17:04:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,060 INFO L225 Difference]: With dead ends: 602 [2019-09-16 17:04:48,060 INFO L226 Difference]: Without dead ends: 602 [2019-09-16 17:04:48,061 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-16 17:04:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-16 17:04:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-16 17:04:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-16 17:04:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-09-16 17:04:48,078 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-09-16 17:04:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,079 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-09-16 17:04:48,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-09-16 17:04:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:48,080 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:48,080 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-16 17:04:48,081 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:48,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-09-16 17:04:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,107 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-16 17:04:48,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:48,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:48,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:48,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:48,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:48,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,111 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-09-16 17:04:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,130 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2019-09-16 17:04:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,135 INFO L225 Difference]: With dead ends: 968 [2019-09-16 17:04:48,136 INFO L226 Difference]: Without dead ends: 968 [2019-09-16 17:04:48,136 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-16 17:04:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-09-16 17:04:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-09-16 17:04:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-16 17:04:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-09-16 17:04:48,159 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-09-16 17:04:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,160 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-09-16 17:04:48,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-09-16 17:04:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:48,162 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:48,163 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-16 17:04:48,164 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-09-16 17:04:48,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:48,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,187 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-16 17:04:48,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:48,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:48,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:48,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:48,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,189 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-09-16 17:04:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,209 INFO L93 Difference]: Finished difference Result 1126 states and 1221 transitions. [2019-09-16 17:04:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,210 INFO L225 Difference]: With dead ends: 1126 [2019-09-16 17:04:48,210 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:04:48,210 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-16 17:04:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:04:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:04:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:04:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:04:48,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-16 17:04:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,214 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:04:48,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:04:48,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:04:48,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:04:48 BoogieIcfgContainer [2019-09-16 17:04:48,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:04:48,226 INFO L168 Benchmark]: Toolchain (without parser) took 2666.65 ms. Allocated memory was 133.7 MB in the beginning and 225.4 MB in the end (delta: 91.8 MB). Free memory was 88.4 MB in the beginning and 122.2 MB in the end (delta: -33.8 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,227 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.19 ms. Allocated memory is still 133.7 MB. Free memory was 88.2 MB in the beginning and 78.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,233 INFO L168 Benchmark]: Boogie Preprocessor took 117.51 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 78.1 MB in the beginning and 175.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,234 INFO L168 Benchmark]: RCFGBuilder took 363.65 ms. Allocated memory is still 199.8 MB. Free memory was 175.9 MB in the beginning and 160.8 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,236 INFO L168 Benchmark]: TraceAbstraction took 1829.73 ms. Allocated memory was 199.8 MB in the beginning and 225.4 MB in the end (delta: 25.7 MB). Free memory was 160.2 MB in the beginning and 122.2 MB in the end (delta: 38.0 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,248 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.17 ms. Allocated memory is still 133.7 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.19 ms. Allocated memory is still 133.7 MB. Free memory was 88.2 MB in the beginning and 78.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.51 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 78.1 MB in the beginning and 175.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.65 ms. Allocated memory is still 199.8 MB. Free memory was 175.9 MB in the beginning and 160.8 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1829.73 ms. Allocated memory was 199.8 MB in the beginning and 225.4 MB in the end (delta: 25.7 MB). Free memory was 160.2 MB in the beginning and 122.2 MB in the end (delta: 38.0 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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, 32 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...