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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:20,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:20,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:20,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:20,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:20,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:20,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:20,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:20,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:20,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:20,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:20,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:20,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:20,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:20,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:20,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:20,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:20,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:20,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:20,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:20,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:20,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:20,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:20,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:20,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:20,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:20,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:20,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:20,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:20,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:20,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:20,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:20,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:20,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:20,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:20,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:20,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:20,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:20,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:20,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:20,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:20,125 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-09-20 13:00:20,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:20,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:20,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:20,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:20,151 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:20,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:20,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:20,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:20,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:20,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:20,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:20,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:20,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:20,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:20,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:20,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:20,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:20,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:20,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:20,155 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:20,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:20,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:20,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:20,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:20,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:20,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:20,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:20,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:20,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:20,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:20,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:20,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:20,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:20,217 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:20,218 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-09-20 13:00:20,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c5ffdd0/c04c50e0fc9446f895cd7450f69a5937/FLAG1c11f24b4 [2019-09-20 13:00:20,732 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:20,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-09-20 13:00:20,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c5ffdd0/c04c50e0fc9446f895cd7450f69a5937/FLAG1c11f24b4 [2019-09-20 13:00:21,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c5ffdd0/c04c50e0fc9446f895cd7450f69a5937 [2019-09-20 13:00:21,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:21,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:21,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:21,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:21,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:21,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cca2c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21, skipping insertion in model container [2019-09-20 13:00:21,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:21,136 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:21,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:21,331 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:21,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:21,362 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:21,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21 WrapperNode [2019-09-20 13:00:21,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:21,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:21,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:21,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:21,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (1/1) ... [2019-09-20 13:00:21,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:21,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:21,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:21,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:21,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:21,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:21,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:21,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:21,823 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:21,824 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:21,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:21 BoogieIcfgContainer [2019-09-20 13:00:21,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:21,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:21,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:21,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:21,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:21" (1/3) ... [2019-09-20 13:00:21,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3064ed29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:21, skipping insertion in model container [2019-09-20 13:00:21,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:21" (2/3) ... [2019-09-20 13:00:21,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3064ed29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:21, skipping insertion in model container [2019-09-20 13:00:21,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:21" (3/3) ... [2019-09-20 13:00:21,838 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-09-20 13:00:21,857 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:21,868 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:21,889 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:21,925 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:21,926 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:21,926 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:21,926 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:21,926 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:21,926 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:21,926 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:21,927 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:21,927 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-20 13:00:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:00:21,955 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,956 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,959 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,965 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-09-20 13:00:21,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,166 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-09-20 13:00:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,247 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-09-20 13:00:22,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:00:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,271 INFO L225 Difference]: With dead ends: 63 [2019-09-20 13:00:22,271 INFO L226 Difference]: Without dead ends: 48 [2019-09-20 13:00:22,278 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-20 13:00:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-09-20 13:00:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-20 13:00:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-09-20 13:00:22,360 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-09-20 13:00:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,361 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-09-20 13:00:22,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-09-20 13:00:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:00:22,364 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,364 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,364 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-09-20 13:00:22,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,468 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-09-20 13:00:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,492 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-09-20 13:00:22,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:00:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,496 INFO L225 Difference]: With dead ends: 77 [2019-09-20 13:00:22,496 INFO L226 Difference]: Without dead ends: 48 [2019-09-20 13:00:22,497 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-20 13:00:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-20 13:00:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:00:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-09-20 13:00:22,507 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-09-20 13:00:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,507 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-09-20 13:00:22,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-09-20 13:00:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:00:22,509 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,509 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,509 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-09-20 13:00:22,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,576 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-09-20 13:00:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,601 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-09-20 13:00:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:00:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,603 INFO L225 Difference]: With dead ends: 72 [2019-09-20 13:00:22,603 INFO L226 Difference]: Without dead ends: 51 [2019-09-20 13:00:22,604 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-20 13:00:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-09-20 13:00:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-20 13:00:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-09-20 13:00:22,613 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-09-20 13:00:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,613 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-09-20 13:00:22,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-09-20 13:00:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:00:22,616 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,616 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,617 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,618 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-09-20 13:00:22,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,675 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-09-20 13:00:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,713 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-09-20 13:00:22,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:00:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,717 INFO L225 Difference]: With dead ends: 88 [2019-09-20 13:00:22,718 INFO L226 Difference]: Without dead ends: 86 [2019-09-20 13:00:22,720 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-20 13:00:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-09-20 13:00:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 13:00:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-09-20 13:00:22,737 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-09-20 13:00:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,738 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-09-20 13:00:22,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-09-20 13:00:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:00:22,739 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,739 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,740 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-09-20 13:00:22,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,771 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-09-20 13:00:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,791 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-09-20 13:00:22,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:00:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,793 INFO L225 Difference]: With dead ends: 144 [2019-09-20 13:00:22,793 INFO L226 Difference]: Without dead ends: 88 [2019-09-20 13:00:22,794 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-20 13:00:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-09-20 13:00:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-20 13:00:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-09-20 13:00:22,804 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-09-20 13:00:22,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,805 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-09-20 13:00:22,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-09-20 13:00:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:22,806 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,806 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,807 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-09-20 13:00:22,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,835 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-09-20 13:00:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,852 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-09-20 13:00:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,855 INFO L225 Difference]: With dead ends: 129 [2019-09-20 13:00:22,855 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 13:00:22,855 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 13:00:22,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-20 13:00:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-20 13:00:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-09-20 13:00:22,865 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-09-20 13:00:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,866 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-09-20 13:00:22,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-09-20 13:00:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:22,867 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,868 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,868 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-09-20 13:00:22,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,921 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-09-20 13:00:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,957 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-09-20 13:00:22,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,963 INFO L225 Difference]: With dead ends: 156 [2019-09-20 13:00:22,964 INFO L226 Difference]: Without dead ends: 154 [2019-09-20 13:00:22,965 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-20 13:00:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-09-20 13:00:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-20 13:00:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-09-20 13:00:22,990 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-09-20 13:00:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,991 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-09-20 13:00:22,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-09-20 13:00:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:22,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,994 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,994 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-09-20 13:00:22,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,026 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-09-20 13:00:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,059 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-09-20 13:00:23,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,062 INFO L225 Difference]: With dead ends: 272 [2019-09-20 13:00:23,062 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:00:23,063 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:00:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-20 13:00:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-20 13:00:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-09-20 13:00:23,092 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-09-20 13:00:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,093 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-09-20 13:00:23,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-09-20 13:00:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:23,094 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,095 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,095 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-09-20 13:00:23,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,159 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-09-20 13:00:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,192 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-09-20 13:00:23,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,195 INFO L225 Difference]: With dead ends: 240 [2019-09-20 13:00:23,195 INFO L226 Difference]: Without dead ends: 166 [2019-09-20 13:00:23,196 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-20 13:00:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-09-20 13:00:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-20 13:00:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-09-20 13:00:23,209 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-09-20 13:00:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,209 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-09-20 13:00:23,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-09-20 13:00:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:23,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,211 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,211 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-09-20 13:00:23,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,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-09-20 13:00:23,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,257 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-09-20 13:00:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,301 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-09-20 13:00:23,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,304 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:00:23,304 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:00:23,305 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:00:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-09-20 13:00:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:00:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-09-20 13:00:23,328 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-09-20 13:00:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,331 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-09-20 13:00:23,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-09-20 13:00:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:23,349 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,349 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,349 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-09-20 13:00:23,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,398 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-09-20 13:00:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,432 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-09-20 13:00:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,436 INFO L225 Difference]: With dead ends: 524 [2019-09-20 13:00:23,436 INFO L226 Difference]: Without dead ends: 306 [2019-09-20 13:00:23,440 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-20 13:00:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-20 13:00:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-20 13:00:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-09-20 13:00:23,463 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-09-20 13:00:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,464 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-09-20 13:00:23,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-09-20 13:00:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:23,465 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,465 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,466 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,466 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-09-20 13:00:23,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,506 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-09-20 13:00:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,528 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-09-20 13:00:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,532 INFO L225 Difference]: With dead ends: 456 [2019-09-20 13:00:23,533 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:00:23,533 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:00:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-09-20 13:00:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-20 13:00:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-09-20 13:00:23,546 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-09-20 13:00:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,546 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-09-20 13:00:23,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-09-20 13:00:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:23,547 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,548 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,548 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-09-20 13:00:23,548 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,580 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-09-20 13:00:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,606 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-09-20 13:00:23,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,610 INFO L225 Difference]: With dead ends: 524 [2019-09-20 13:00:23,610 INFO L226 Difference]: Without dead ends: 522 [2019-09-20 13:00:23,611 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-20 13:00:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-09-20 13:00:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-20 13:00:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-09-20 13:00:23,626 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-09-20 13:00:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,626 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-09-20 13:00:23,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-09-20 13:00:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:23,630 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,630 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,630 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-09-20 13:00:23,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,653 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-09-20 13:00:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,683 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-09-20 13:00:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,687 INFO L225 Difference]: With dead ends: 1020 [2019-09-20 13:00:23,687 INFO L226 Difference]: Without dead ends: 586 [2019-09-20 13:00:23,688 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-20 13:00:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-09-20 13:00:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-20 13:00:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-09-20 13:00:23,708 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-09-20 13:00:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,708 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-09-20 13:00:23,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-09-20 13:00:23,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:23,710 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,710 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,710 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,711 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-09-20 13:00:23,711 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,728 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-09-20 13:00:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,749 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-09-20 13:00:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,753 INFO L225 Difference]: With dead ends: 876 [2019-09-20 13:00:23,753 INFO L226 Difference]: Without dead ends: 602 [2019-09-20 13:00:23,754 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-20 13:00:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-20 13:00:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-20 13:00:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-09-20 13:00:23,775 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-09-20 13:00:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,775 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-09-20 13:00:23,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-09-20 13:00:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:23,777 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,777 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,777 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-09-20 13:00:23,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,795 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-09-20 13:00:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,828 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-09-20 13:00:23,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,833 INFO L225 Difference]: With dead ends: 970 [2019-09-20 13:00:23,833 INFO L226 Difference]: Without dead ends: 968 [2019-09-20 13:00:23,834 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-09-20 13:00:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-09-20 13:00:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-20 13:00:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-09-20 13:00:23,861 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-09-20 13:00:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,861 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-09-20 13:00:23,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-09-20 13:00:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:23,863 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,864 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,864 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,864 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-09-20 13:00:23,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,888 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-09-20 13:00:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,932 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-09-20 13:00:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,933 INFO L225 Difference]: With dead ends: 1992 [2019-09-20 13:00:23,933 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:00:23,937 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:00:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:00:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:00:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:00:23,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-20 13:00:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,939 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:00:23,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:00:23,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:00:23,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:00:23,962 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 13:00:23,962 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:23,962 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:23,962 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 13:00:23,962 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 13:00:23,962 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:23,963 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-09-20 13:00:23,963 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-09-20 13:00:23,963 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,963 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-09-20 13:00:23,963 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-09-20 13:00:23,963 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-09-20 13:00:23,963 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,963 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,964 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,964 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-09-20 13:00:23,964 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-09-20 13:00:23,964 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,964 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-09-20 13:00:23,965 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-20 13:00:23,965 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,965 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-09-20 13:00:23,965 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-20 13:00:23,965 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-09-20 13:00:23,965 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-09-20 13:00:23,966 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,966 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,966 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,966 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-09-20 13:00:23,967 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,967 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-09-20 13:00:23,967 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-09-20 13:00:23,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:00:23 BoogieIcfgContainer [2019-09-20 13:00:23,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:00:23,980 INFO L168 Benchmark]: Toolchain (without parser) took 2879.50 ms. Allocated memory was 130.5 MB in the beginning and 219.2 MB in the end (delta: 88.6 MB). Free memory was 84.8 MB in the beginning and 89.2 MB in the end (delta: -4.5 MB). Peak memory consumption was 84.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,981 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 130.5 MB. Free memory was 103.4 MB in the beginning and 103.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.40 ms. Allocated memory is still 130.5 MB. Free memory was 84.6 MB in the beginning and 74.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,982 INFO L168 Benchmark]: Boogie Preprocessor took 135.39 ms. Allocated memory was 130.5 MB in the beginning and 199.8 MB in the end (delta: 69.2 MB). Free memory was 74.5 MB in the beginning and 175.5 MB in the end (delta: -101.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,983 INFO L168 Benchmark]: RCFGBuilder took 327.35 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 159.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,984 INFO L168 Benchmark]: TraceAbstraction took 2147.96 ms. Allocated memory was 199.8 MB in the beginning and 219.2 MB in the end (delta: 19.4 MB). Free memory was 159.9 MB in the beginning and 89.2 MB in the end (delta: 70.7 MB). Peak memory consumption was 90.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,988 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.52 ms. Allocated memory is still 130.5 MB. Free memory was 103.4 MB in the beginning and 103.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.40 ms. Allocated memory is still 130.5 MB. Free memory was 84.6 MB in the beginning and 74.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.39 ms. Allocated memory was 130.5 MB in the beginning and 199.8 MB in the end (delta: 69.2 MB). Free memory was 74.5 MB in the beginning and 175.5 MB in the end (delta: -101.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 327.35 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 159.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2147.96 ms. Allocated memory was 199.8 MB in the beginning and 219.2 MB in the end (delta: 19.4 MB). Free memory was 159.9 MB in the beginning and 89.2 MB in the end (delta: 70.7 MB). Peak memory consumption was 90.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...