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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:32,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:32,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:32,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:32,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:32,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:32,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:32,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:32,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:32,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:32,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:32,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:32,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:32,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:32,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:32,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:32,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:32,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:32,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:32,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:32,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:32,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:32,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:32,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:32,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:32,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:32,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:32,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:32,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:32,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:32,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:32,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:32,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:32,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:32,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:32,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:32,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:32,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:32,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:32,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:32,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:32,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:14:32,530 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:32,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:32,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:32,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:32,532 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:32,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:32,532 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:32,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:32,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:32,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:32,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:32,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:32,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:32,534 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:32,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:32,535 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:32,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:32,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:32,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:32,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:32,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:32,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:32,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:32,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:32,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:32,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:32,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:32,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:32,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:32,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:32,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:32,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:32,837 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:32,838 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:32,838 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-10-13 19:14:32,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a57e886/008d48e7cdc442829934c4b4355074d0/FLAG10a3ad5f0 [2019-10-13 19:14:33,372 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:33,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-10-13 19:14:33,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a57e886/008d48e7cdc442829934c4b4355074d0/FLAG10a3ad5f0 [2019-10-13 19:14:33,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a57e886/008d48e7cdc442829934c4b4355074d0 [2019-10-13 19:14:33,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:33,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:33,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:33,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:33,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:33,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:33,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404140b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:33, skipping insertion in model container [2019-10-13 19:14:33,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:33" (1/1) ... [2019-10-13 19:14:33,742 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:33,771 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:33,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:33,956 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:33,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:34,000 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:34,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34 WrapperNode [2019-10-13 19:14:34,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:34,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:34,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:34,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:34,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:34,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:34,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:34,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:34,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:34,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:34,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:34,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:34,559 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:34,560 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:34,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:34 BoogieIcfgContainer [2019-10-13 19:14:34,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:34,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:34,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:34,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:34,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:33" (1/3) ... [2019-10-13 19:14:34,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d219be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:34, skipping insertion in model container [2019-10-13 19:14:34,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (2/3) ... [2019-10-13 19:14:34,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d219be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:34, skipping insertion in model container [2019-10-13 19:14:34,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:34" (3/3) ... [2019-10-13 19:14:34,581 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-10-13 19:14:34,589 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:34,596 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:34,604 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:34,635 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:34,635 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:34,635 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:34,635 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:34,635 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:34,636 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:34,636 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:34,636 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-13 19:14:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:34,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:34,661 INFO L380 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-10-13 19:14:34,663 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-10-13 19:14:34,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:34,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813850041] [2019-10-13 19:14:34,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:34,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:34,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:34,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813850041] [2019-10-13 19:14:34,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:34,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:34,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832581912] [2019-10-13 19:14:34,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:34,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:34,887 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-10-13 19:14:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:34,953 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2019-10-13 19:14:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:34,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:34,967 INFO L225 Difference]: With dead ends: 93 [2019-10-13 19:14:34,967 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 19:14:34,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 19:14:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-10-13 19:14:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 19:14:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-10-13 19:14:35,028 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-10-13 19:14:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,029 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-10-13 19:14:35,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-10-13 19:14:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:35,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,031 INFO L380 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-10-13 19:14:35,031 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-10-13 19:14:35,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261026004] [2019-10-13 19:14:35,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261026004] [2019-10-13 19:14:35,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767942375] [2019-10-13 19:14:35,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,114 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-10-13 19:14:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,162 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2019-10-13 19:14:35,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,165 INFO L225 Difference]: With dead ends: 127 [2019-10-13 19:14:35,165 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 19:14:35,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 19:14:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-13 19:14:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 19:14:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-10-13 19:14:35,180 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-10-13 19:14:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,180 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-10-13 19:14:35,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-10-13 19:14:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:35,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,182 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-10-13 19:14:35,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77987915] [2019-10-13 19:14:35,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77987915] [2019-10-13 19:14:35,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613803917] [2019-10-13 19:14:35,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,260 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-10-13 19:14:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,287 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2019-10-13 19:14:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,290 INFO L225 Difference]: With dead ends: 117 [2019-10-13 19:14:35,290 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 19:14:35,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 19:14:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-10-13 19:14:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-13 19:14:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-10-13 19:14:35,302 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-10-13 19:14:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,302 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-10-13 19:14:35,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-10-13 19:14:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:35,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,304 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-10-13 19:14:35,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159916927] [2019-10-13 19:14:35,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159916927] [2019-10-13 19:14:35,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233588235] [2019-10-13 19:14:35,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,376 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-10-13 19:14:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,402 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2019-10-13 19:14:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,405 INFO L225 Difference]: With dead ends: 148 [2019-10-13 19:14:35,405 INFO L226 Difference]: Without dead ends: 146 [2019-10-13 19:14:35,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-13 19:14:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-10-13 19:14:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-13 19:14:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-10-13 19:14:35,417 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-10-13 19:14:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,417 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-10-13 19:14:35,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-10-13 19:14:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:35,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,419 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,420 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-10-13 19:14:35,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079818935] [2019-10-13 19:14:35,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079818935] [2019-10-13 19:14:35,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706678069] [2019-10-13 19:14:35,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,490 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-10-13 19:14:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,516 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2019-10-13 19:14:35,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,519 INFO L225 Difference]: With dead ends: 244 [2019-10-13 19:14:35,519 INFO L226 Difference]: Without dead ends: 148 [2019-10-13 19:14:35,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-13 19:14:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-10-13 19:14:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-13 19:14:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-10-13 19:14:35,538 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-10-13 19:14:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,538 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-10-13 19:14:35,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-10-13 19:14:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,540 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,541 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-10-13 19:14:35,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504433371] [2019-10-13 19:14:35,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504433371] [2019-10-13 19:14:35,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693042019] [2019-10-13 19:14:35,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,582 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-10-13 19:14:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,601 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2019-10-13 19:14:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,603 INFO L225 Difference]: With dead ends: 219 [2019-10-13 19:14:35,603 INFO L226 Difference]: Without dead ends: 150 [2019-10-13 19:14:35,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-13 19:14:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-10-13 19:14:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-13 19:14:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-10-13 19:14:35,616 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-10-13 19:14:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,616 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-10-13 19:14:35,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-10-13 19:14:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,619 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-10-13 19:14:35,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480634240] [2019-10-13 19:14:35,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480634240] [2019-10-13 19:14:35,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717700588] [2019-10-13 19:14:35,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,662 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-10-13 19:14:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,696 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2019-10-13 19:14:35,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,699 INFO L225 Difference]: With dead ends: 276 [2019-10-13 19:14:35,699 INFO L226 Difference]: Without dead ends: 274 [2019-10-13 19:14:35,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-13 19:14:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-10-13 19:14:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-13 19:14:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-10-13 19:14:35,719 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-10-13 19:14:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,720 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-10-13 19:14:35,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-10-13 19:14:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,722 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,722 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-10-13 19:14:35,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864021008] [2019-10-13 19:14:35,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864021008] [2019-10-13 19:14:35,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977291191] [2019-10-13 19:14:35,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,785 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-10-13 19:14:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,819 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2019-10-13 19:14:35,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,821 INFO L225 Difference]: With dead ends: 472 [2019-10-13 19:14:35,821 INFO L226 Difference]: Without dead ends: 282 [2019-10-13 19:14:35,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-13 19:14:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-10-13 19:14:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 19:14:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-10-13 19:14:35,848 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-10-13 19:14:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,849 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-10-13 19:14:35,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-10-13 19:14:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:35,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,851 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,851 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-10-13 19:14:35,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931685640] [2019-10-13 19:14:35,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931685640] [2019-10-13 19:14:35,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537266892] [2019-10-13 19:14:35,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,886 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-10-13 19:14:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,912 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2019-10-13 19:14:35,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,914 INFO L225 Difference]: With dead ends: 420 [2019-10-13 19:14:35,914 INFO L226 Difference]: Without dead ends: 286 [2019-10-13 19:14:35,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-13 19:14:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-10-13 19:14:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-13 19:14:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-10-13 19:14:35,930 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-10-13 19:14:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,930 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-10-13 19:14:35,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-10-13 19:14:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:35,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,938 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,939 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-10-13 19:14:35,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648830517] [2019-10-13 19:14:35,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648830517] [2019-10-13 19:14:35,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860577439] [2019-10-13 19:14:35,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,990 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-10-13 19:14:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,017 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2019-10-13 19:14:36,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,023 INFO L225 Difference]: With dead ends: 524 [2019-10-13 19:14:36,023 INFO L226 Difference]: Without dead ends: 522 [2019-10-13 19:14:36,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-13 19:14:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-10-13 19:14:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-13 19:14:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-10-13 19:14:36,049 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-10-13 19:14:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,052 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-10-13 19:14:36,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-10-13 19:14:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:36,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,053 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,054 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-10-13 19:14:36,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872253433] [2019-10-13 19:14:36,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872253433] [2019-10-13 19:14:36,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090755029] [2019-10-13 19:14:36,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,096 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-10-13 19:14:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,123 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2019-10-13 19:14:36,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,127 INFO L225 Difference]: With dead ends: 924 [2019-10-13 19:14:36,127 INFO L226 Difference]: Without dead ends: 546 [2019-10-13 19:14:36,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-13 19:14:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-10-13 19:14:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-13 19:14:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-10-13 19:14:36,146 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-10-13 19:14:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,146 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-10-13 19:14:36,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-10-13 19:14:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,148 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,148 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-10-13 19:14:36,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831103331] [2019-10-13 19:14:36,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831103331] [2019-10-13 19:14:36,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903326088] [2019-10-13 19:14:36,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,182 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-10-13 19:14:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,203 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2019-10-13 19:14:36,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,208 INFO L225 Difference]: With dead ends: 816 [2019-10-13 19:14:36,208 INFO L226 Difference]: Without dead ends: 554 [2019-10-13 19:14:36,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-13 19:14:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-10-13 19:14:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-13 19:14:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-10-13 19:14:36,227 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-10-13 19:14:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,227 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-10-13 19:14:36,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-10-13 19:14:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,229 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,229 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-10-13 19:14:36,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732423467] [2019-10-13 19:14:36,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732423467] [2019-10-13 19:14:36,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461438519] [2019-10-13 19:14:36,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,278 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-10-13 19:14:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,305 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2019-10-13 19:14:36,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,310 INFO L225 Difference]: With dead ends: 1004 [2019-10-13 19:14:36,310 INFO L226 Difference]: Without dead ends: 1002 [2019-10-13 19:14:36,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-10-13 19:14:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-10-13 19:14:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-13 19:14:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-10-13 19:14:36,334 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-10-13 19:14:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,335 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-10-13 19:14:36,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-10-13 19:14:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,337 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,337 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-10-13 19:14:36,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604108995] [2019-10-13 19:14:36,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604108995] [2019-10-13 19:14:36,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269397334] [2019-10-13 19:14:36,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,363 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-10-13 19:14:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,395 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2019-10-13 19:14:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,401 INFO L225 Difference]: With dead ends: 1820 [2019-10-13 19:14:36,402 INFO L226 Difference]: Without dead ends: 1066 [2019-10-13 19:14:36,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-10-13 19:14:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-10-13 19:14:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-10-13 19:14:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-10-13 19:14:36,442 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-10-13 19:14:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,442 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-10-13 19:14:36,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-10-13 19:14:36,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:36,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,445 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,445 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,446 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-10-13 19:14:36,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323601951] [2019-10-13 19:14:36,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323601951] [2019-10-13 19:14:36,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204789372] [2019-10-13 19:14:36,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,477 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-10-13 19:14:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,520 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2019-10-13 19:14:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,528 INFO L225 Difference]: With dead ends: 1596 [2019-10-13 19:14:36,528 INFO L226 Difference]: Without dead ends: 1082 [2019-10-13 19:14:36,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-10-13 19:14:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-10-13 19:14:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-10-13 19:14:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-10-13 19:14:36,589 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-10-13 19:14:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,591 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-10-13 19:14:36,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-10-13 19:14:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:36,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,594 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,595 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-10-13 19:14:36,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940325510] [2019-10-13 19:14:36,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940325510] [2019-10-13 19:14:36,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772494674] [2019-10-13 19:14:36,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,636 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-10-13 19:14:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,676 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2019-10-13 19:14:36,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,688 INFO L225 Difference]: With dead ends: 1932 [2019-10-13 19:14:36,689 INFO L226 Difference]: Without dead ends: 1930 [2019-10-13 19:14:36,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-13 19:14:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-10-13 19:14:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-13 19:14:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-10-13 19:14:36,745 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-10-13 19:14:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,745 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-10-13 19:14:36,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-10-13 19:14:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:36,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,751 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-10-13 19:14:36,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032852740] [2019-10-13 19:14:36,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032852740] [2019-10-13 19:14:36,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415842540] [2019-10-13 19:14:36,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,778 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-10-13 19:14:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,828 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2019-10-13 19:14:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,839 INFO L225 Difference]: With dead ends: 3596 [2019-10-13 19:14:36,839 INFO L226 Difference]: Without dead ends: 2090 [2019-10-13 19:14:36,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-10-13 19:14:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-10-13 19:14:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-10-13 19:14:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-10-13 19:14:36,906 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-10-13 19:14:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,906 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-10-13 19:14:36,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-10-13 19:14:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:36,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,911 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-10-13 19:14:36,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34893557] [2019-10-13 19:14:36,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34893557] [2019-10-13 19:14:36,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580706194] [2019-10-13 19:14:36,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,937 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-10-13 19:14:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,982 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2019-10-13 19:14:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,992 INFO L225 Difference]: With dead ends: 3132 [2019-10-13 19:14:36,992 INFO L226 Difference]: Without dead ends: 2122 [2019-10-13 19:14:36,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-13 19:14:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-10-13 19:14:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-10-13 19:14:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-10-13 19:14:37,063 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-10-13 19:14:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,064 INFO L462 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-10-13 19:14:37,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-10-13 19:14:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:37,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:37,068 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-10-13 19:14:37,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462415452] [2019-10-13 19:14:37,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462415452] [2019-10-13 19:14:37,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199595610] [2019-10-13 19:14:37,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,098 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-10-13 19:14:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,170 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2019-10-13 19:14:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,187 INFO L225 Difference]: With dead ends: 3724 [2019-10-13 19:14:37,187 INFO L226 Difference]: Without dead ends: 3722 [2019-10-13 19:14:37,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-13 19:14:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-10-13 19:14:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-10-13 19:14:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-10-13 19:14:37,266 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-10-13 19:14:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,267 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-10-13 19:14:37,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-10-13 19:14:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:37,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,272 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:37,272 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,273 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-10-13 19:14:37,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226491917] [2019-10-13 19:14:37,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226491917] [2019-10-13 19:14:37,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408787330] [2019-10-13 19:14:37,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,298 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-10-13 19:14:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,363 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2019-10-13 19:14:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,383 INFO L225 Difference]: With dead ends: 7116 [2019-10-13 19:14:37,383 INFO L226 Difference]: Without dead ends: 4106 [2019-10-13 19:14:37,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-10-13 19:14:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-10-13 19:14:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-13 19:14:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-10-13 19:14:37,498 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-10-13 19:14:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,498 INFO L462 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-10-13 19:14:37,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-10-13 19:14:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:37,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,504 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:37,504 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-10-13 19:14:37,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350274581] [2019-10-13 19:14:37,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350274581] [2019-10-13 19:14:37,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781874811] [2019-10-13 19:14:37,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,535 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-10-13 19:14:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,598 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2019-10-13 19:14:37,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,618 INFO L225 Difference]: With dead ends: 6156 [2019-10-13 19:14:37,618 INFO L226 Difference]: Without dead ends: 4170 [2019-10-13 19:14:37,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-10-13 19:14:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-10-13 19:14:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-10-13 19:14:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-10-13 19:14:37,841 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-10-13 19:14:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,842 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-10-13 19:14:37,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-10-13 19:14:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:37,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:37,850 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-10-13 19:14:37,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844665284] [2019-10-13 19:14:37,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844665284] [2019-10-13 19:14:37,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138855640] [2019-10-13 19:14:37,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,884 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-10-13 19:14:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:38,008 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2019-10-13 19:14:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:38,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:38,038 INFO L225 Difference]: With dead ends: 12108 [2019-10-13 19:14:38,039 INFO L226 Difference]: Without dead ends: 8074 [2019-10-13 19:14:38,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-13 19:14:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-10-13 19:14:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-13 19:14:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-10-13 19:14:38,271 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-10-13 19:14:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:38,271 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-10-13 19:14:38,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-10-13 19:14:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:38,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:38,282 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:38,283 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:38,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-10-13 19:14:38,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:38,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594099868] [2019-10-13 19:14:38,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:38,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594099868] [2019-10-13 19:14:38,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:38,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:38,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925546666] [2019-10-13 19:14:38,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:38,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:38,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:38,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,312 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-10-13 19:14:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:38,468 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2019-10-13 19:14:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:38,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:38,488 INFO L225 Difference]: With dead ends: 9100 [2019-10-13 19:14:38,488 INFO L226 Difference]: Without dead ends: 9098 [2019-10-13 19:14:38,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-10-13 19:14:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-10-13 19:14:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-13 19:14:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-10-13 19:14:38,697 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-10-13 19:14:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:38,698 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-10-13 19:14:38,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-10-13 19:14:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:38,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:38,709 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:38,709 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-10-13 19:14:38,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:38,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012859650] [2019-10-13 19:14:38,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:38,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012859650] [2019-10-13 19:14:38,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:38,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:38,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533985349] [2019-10-13 19:14:38,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:38,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:38,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,734 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-10-13 19:14:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:38,967 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2019-10-13 19:14:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:38,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:38,992 INFO L225 Difference]: With dead ends: 13708 [2019-10-13 19:14:38,992 INFO L226 Difference]: Without dead ends: 13706 [2019-10-13 19:14:38,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-10-13 19:14:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-10-13 19:14:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-10-13 19:14:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-10-13 19:14:39,240 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-10-13 19:14:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,240 INFO L462 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-10-13 19:14:39,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-10-13 19:14:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:39,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,259 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:39,260 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-10-13 19:14:39,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286943871] [2019-10-13 19:14:39,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286943871] [2019-10-13 19:14:39,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661322644] [2019-10-13 19:14:39,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,283 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-10-13 19:14:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:39,476 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2019-10-13 19:14:39,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:39,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:39,508 INFO L225 Difference]: With dead ends: 27788 [2019-10-13 19:14:39,508 INFO L226 Difference]: Without dead ends: 15754 [2019-10-13 19:14:39,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-10-13 19:14:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-10-13 19:14:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-10-13 19:14:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-10-13 19:14:39,921 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-10-13 19:14:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,922 INFO L462 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-10-13 19:14:39,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-10-13 19:14:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:39,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,942 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:39,942 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-10-13 19:14:39,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119525616] [2019-10-13 19:14:39,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119525616] [2019-10-13 19:14:39,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032447261] [2019-10-13 19:14:39,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,963 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-10-13 19:14:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,235 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2019-10-13 19:14:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,263 INFO L225 Difference]: With dead ends: 23820 [2019-10-13 19:14:40,263 INFO L226 Difference]: Without dead ends: 16138 [2019-10-13 19:14:40,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-10-13 19:14:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-10-13 19:14:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-10-13 19:14:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-10-13 19:14:40,556 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-10-13 19:14:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,557 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-10-13 19:14:40,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-10-13 19:14:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:40,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,578 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:40,578 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-10-13 19:14:40,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644153042] [2019-10-13 19:14:40,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:40,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644153042] [2019-10-13 19:14:40,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854820950] [2019-10-13 19:14:40,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,600 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-10-13 19:14:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,879 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2019-10-13 19:14:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:41,425 INFO L225 Difference]: With dead ends: 26636 [2019-10-13 19:14:41,426 INFO L226 Difference]: Without dead ends: 26634 [2019-10-13 19:14:41,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-10-13 19:14:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-10-13 19:14:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-10-13 19:14:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-10-13 19:14:41,808 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-10-13 19:14:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,808 INFO L462 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-10-13 19:14:41,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-10-13 19:14:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:41,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:41,847 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-10-13 19:14:41,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558579549] [2019-10-13 19:14:41,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:41,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558579549] [2019-10-13 19:14:41,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268035499] [2019-10-13 19:14:41,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,876 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-10-13 19:14:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:42,468 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2019-10-13 19:14:42,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:42,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:42,540 INFO L225 Difference]: With dead ends: 55308 [2019-10-13 19:14:42,540 INFO L226 Difference]: Without dead ends: 31242 [2019-10-13 19:14:42,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-10-13 19:14:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-10-13 19:14:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-10-13 19:14:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-10-13 19:14:43,163 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-10-13 19:14:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:43,163 INFO L462 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-10-13 19:14:43,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-10-13 19:14:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:43,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:43,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:43,205 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-10-13 19:14:43,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:43,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907680784] [2019-10-13 19:14:43,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:43,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:43,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:43,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907680784] [2019-10-13 19:14:43,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:43,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:43,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524637295] [2019-10-13 19:14:43,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:43,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:43,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:43,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:43,238 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-10-13 19:14:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:43,633 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2019-10-13 19:14:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:43,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:43,700 INFO L225 Difference]: With dead ends: 46860 [2019-10-13 19:14:43,700 INFO L226 Difference]: Without dead ends: 31754 [2019-10-13 19:14:43,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-10-13 19:14:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-10-13 19:14:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-10-13 19:14:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-10-13 19:14:44,900 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-10-13 19:14:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:44,900 INFO L462 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-10-13 19:14:44,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-10-13 19:14:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:44,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:44,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:44,932 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-10-13 19:14:44,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:44,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167800027] [2019-10-13 19:14:44,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:44,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:44,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:44,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167800027] [2019-10-13 19:14:44,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:44,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:44,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514367850] [2019-10-13 19:14:44,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:44,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:44,969 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-10-13 19:14:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:45,548 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2019-10-13 19:14:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:45,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:45,619 INFO L225 Difference]: With dead ends: 51210 [2019-10-13 19:14:45,619 INFO L226 Difference]: Without dead ends: 51208 [2019-10-13 19:14:45,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-10-13 19:14:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-10-13 19:14:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-10-13 19:14:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-10-13 19:14:47,582 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-10-13 19:14:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:47,583 INFO L462 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-10-13 19:14:47,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-10-13 19:14:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:47,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:47,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:47,636 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-10-13 19:14:47,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:47,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156458037] [2019-10-13 19:14:47,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:47,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156458037] [2019-10-13 19:14:47,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:47,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:47,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699740661] [2019-10-13 19:14:47,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:47,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:47,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:47,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:47,670 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-10-13 19:14:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,506 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2019-10-13 19:14:48,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,507 INFO L225 Difference]: With dead ends: 109576 [2019-10-13 19:14:48,507 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:48,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:48,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-13 19:14:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,631 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:48,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:48,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:48,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:48,670 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:14:48,671 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:48,671 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:48,671 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:48,671 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:48,672 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:48,672 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-10-13 19:14:48,673 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-13 19:14:48,673 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-10-13 19:14:48,673 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-10-13 19:14:48,673 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-13 19:14:48,674 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-10-13 19:14:48,674 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-10-13 19:14:48,674 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,674 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,674 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,674 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,674 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-10-13 19:14:48,674 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,675 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-13 19:14:48,675 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,675 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,675 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-10-13 19:14:48,675 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,675 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-10-13 19:14:48,675 INFO L443 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,675 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,676 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-10-13 19:14:48,676 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-13 19:14:48,676 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-13 19:14:48,676 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,676 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,676 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-13 19:14:48,676 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-13 19:14:48,676 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-10-13 19:14:48,676 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,677 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,677 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,677 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,677 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,677 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,677 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,677 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-13 19:14:48,677 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-10-13 19:14:48,678 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,678 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-10-13 19:14:48,678 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-10-13 19:14:48,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:48 BoogieIcfgContainer [2019-10-13 19:14:48,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:48,703 INFO L168 Benchmark]: Toolchain (without parser) took 14972.78 ms. Allocated memory was 137.9 MB in the beginning and 1.0 GB in the end (delta: 889.7 MB). Free memory was 101.2 MB in the beginning and 344.6 MB in the end (delta: -243.4 MB). Peak memory consumption was 646.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:48,704 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:48,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.93 ms. Allocated memory is still 137.9 MB. Free memory was 101.0 MB in the beginning and 90.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:48,705 INFO L168 Benchmark]: Boogie Preprocessor took 139.58 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 90.1 MB in the beginning and 179.4 MB in the end (delta: -89.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:48,706 INFO L168 Benchmark]: RCFGBuilder took 427.54 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 159.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:48,706 INFO L168 Benchmark]: TraceAbstraction took 14123.02 ms. Allocated memory was 201.9 MB in the beginning and 1.0 GB in the end (delta: 825.8 MB). Free memory was 159.6 MB in the beginning and 344.6 MB in the end (delta: -185.0 MB). Peak memory consumption was 640.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:48,713 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.50 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.93 ms. Allocated memory is still 137.9 MB. Free memory was 101.0 MB in the beginning and 90.1 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.58 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 90.1 MB in the beginning and 179.4 MB in the end (delta: -89.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.54 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 159.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14123.02 ms. Allocated memory was 201.9 MB in the beginning and 1.0 GB in the end (delta: 825.8 MB). Free memory was 159.6 MB in the beginning and 344.6 MB in the end (delta: -185.0 MB). Peak memory consumption was 640.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: SAFE, OverallTime: 14.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...