/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:09,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:09,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:09,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:09,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:09,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:09,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:09,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:09,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:09,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:09,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:09,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:09,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:09,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:09,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:09,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:09,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:09,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:09,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:09,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:09,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:09,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:09,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:09,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:09,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:09,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:09,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:09,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:09,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:09,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:09,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:09,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:09,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:09,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:09,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:09,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:09,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:09,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:09,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:09,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:09,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:09,255 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-11-23 22:06:09,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:09,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:09,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:09,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:09,283 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:09,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:09,283 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:09,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:09,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:09,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:09,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:09,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:09,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:09,284 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:09,284 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:09,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:09,285 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:09,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:09,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:09,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:09,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:09,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:09,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:09,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:09,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:09,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:09,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:09,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:09,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:09,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:09,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:09,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:09,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:09,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:09,570 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:09,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-11-23 22:06:09,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7299a0a13/287babdbe4734a36b45e90f3091f2956/FLAGa370c89aa [2019-11-23 22:06:10,041 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:10,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-11-23 22:06:10,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7299a0a13/287babdbe4734a36b45e90f3091f2956/FLAGa370c89aa [2019-11-23 22:06:10,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7299a0a13/287babdbe4734a36b45e90f3091f2956 [2019-11-23 22:06:10,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:10,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:10,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:10,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:10,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:10,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9ac29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10, skipping insertion in model container [2019-11-23 22:06:10,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:10,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:10,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:10,719 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:10,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:10,899 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:10,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10 WrapperNode [2019-11-23 22:06:10,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:10,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:10,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:10,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:10,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:10,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:10,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:10,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:10,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (1/1) ... [2019-11-23 22:06:10,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:10,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:10,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:10,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:10,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (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-11-23 22:06:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:11,365 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:11,365 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:11,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:11 BoogieIcfgContainer [2019-11-23 22:06:11,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:11,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:11,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:11,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:11,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:10" (1/3) ... [2019-11-23 22:06:11,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8cac0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:11, skipping insertion in model container [2019-11-23 22:06:11,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:10" (2/3) ... [2019-11-23 22:06:11,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8cac0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:11, skipping insertion in model container [2019-11-23 22:06:11,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:11" (3/3) ... [2019-11-23 22:06:11,375 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-11-23 22:06:11,384 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:11,394 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:11,414 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:11,437 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:11,438 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:11,438 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:11,438 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:11,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:11,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:11,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:11,439 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-11-23 22:06:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:06:11,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:11,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:11,459 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash -977352837, now seen corresponding path program 1 times [2019-11-23 22:06:11,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:11,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025516861] [2019-11-23 22:06:11,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:11,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025516861] [2019-11-23 22:06:11,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:11,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:11,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978176774] [2019-11-23 22:06:11,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:11,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:11,716 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-11-23 22:06:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:11,785 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2019-11-23 22:06:11,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:11,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:06:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:11,797 INFO L225 Difference]: With dead ends: 82 [2019-11-23 22:06:11,797 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 22:06:11,800 INFO L630 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-11-23 22:06:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 22:06:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-11-23 22:06:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 22:06:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2019-11-23 22:06:11,842 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2019-11-23 22:06:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:11,842 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2019-11-23 22:06:11,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2019-11-23 22:06:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:06:11,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:11,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:11,844 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1564158851, now seen corresponding path program 1 times [2019-11-23 22:06:11,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:11,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306516752] [2019-11-23 22:06:11,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:11,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306516752] [2019-11-23 22:06:11,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:11,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:11,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889870785] [2019-11-23 22:06:11,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:11,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:11,911 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand 3 states. [2019-11-23 22:06:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:11,943 INFO L93 Difference]: Finished difference Result 113 states and 208 transitions. [2019-11-23 22:06:11,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:11,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:06:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:11,945 INFO L225 Difference]: With dead ends: 113 [2019-11-23 22:06:11,945 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 22:06:11,946 INFO L630 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-11-23 22:06:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 22:06:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-23 22:06:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 22:06:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-11-23 22:06:11,957 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 16 [2019-11-23 22:06:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:11,958 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-11-23 22:06:11,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-11-23 22:06:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:11,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:11,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:11,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:11,960 INFO L82 PathProgramCache]: Analyzing trace with hash -232953528, now seen corresponding path program 1 times [2019-11-23 22:06:11,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:11,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546144022] [2019-11-23 22:06:11,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546144022] [2019-11-23 22:06:12,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143512915] [2019-11-23 22:06:12,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,006 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-11-23 22:06:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,040 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2019-11-23 22:06:12,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,043 INFO L225 Difference]: With dead ends: 104 [2019-11-23 22:06:12,043 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 22:06:12,044 INFO L630 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-11-23 22:06:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 22:06:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-11-23 22:06:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-23 22:06:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 123 transitions. [2019-11-23 22:06:12,057 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 123 transitions. Word has length 17 [2019-11-23 22:06:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,058 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 123 transitions. [2019-11-23 22:06:12,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2019-11-23 22:06:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:12,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,060 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1244070778, now seen corresponding path program 1 times [2019-11-23 22:06:12,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540404389] [2019-11-23 22:06:12,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540404389] [2019-11-23 22:06:12,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849289322] [2019-11-23 22:06:12,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,103 INFO L87 Difference]: Start difference. First operand 69 states and 123 transitions. Second operand 3 states. [2019-11-23 22:06:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,120 INFO L93 Difference]: Finished difference Result 132 states and 236 transitions. [2019-11-23 22:06:12,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,122 INFO L225 Difference]: With dead ends: 132 [2019-11-23 22:06:12,123 INFO L226 Difference]: Without dead ends: 130 [2019-11-23 22:06:12,123 INFO L630 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-11-23 22:06:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-23 22:06:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2019-11-23 22:06:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-23 22:06:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2019-11-23 22:06:12,141 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 17 [2019-11-23 22:06:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,141 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2019-11-23 22:06:12,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2019-11-23 22:06:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:12,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,146 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1830876792, now seen corresponding path program 1 times [2019-11-23 22:06:12,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491638828] [2019-11-23 22:06:12,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491638828] [2019-11-23 22:06:12,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145288534] [2019-11-23 22:06:12,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,230 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand 3 states. [2019-11-23 22:06:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,273 INFO L93 Difference]: Finished difference Result 220 states and 394 transitions. [2019-11-23 22:06:12,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,276 INFO L225 Difference]: With dead ends: 220 [2019-11-23 22:06:12,276 INFO L226 Difference]: Without dead ends: 132 [2019-11-23 22:06:12,277 INFO L630 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-11-23 22:06:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-23 22:06:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-11-23 22:06:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-23 22:06:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 230 transitions. [2019-11-23 22:06:12,288 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 230 transitions. Word has length 17 [2019-11-23 22:06:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,289 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 230 transitions. [2019-11-23 22:06:12,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 230 transitions. [2019-11-23 22:06:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:12,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 88725234, now seen corresponding path program 1 times [2019-11-23 22:06:12,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384958656] [2019-11-23 22:06:12,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384958656] [2019-11-23 22:06:12,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259666413] [2019-11-23 22:06:12,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,327 INFO L87 Difference]: Start difference. First operand 130 states and 230 transitions. Second operand 3 states. [2019-11-23 22:06:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,344 INFO L93 Difference]: Finished difference Result 197 states and 345 transitions. [2019-11-23 22:06:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,346 INFO L225 Difference]: With dead ends: 197 [2019-11-23 22:06:12,346 INFO L226 Difference]: Without dead ends: 134 [2019-11-23 22:06:12,347 INFO L630 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-11-23 22:06:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-23 22:06:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-23 22:06:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-23 22:06:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2019-11-23 22:06:12,359 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 18 [2019-11-23 22:06:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,359 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2019-11-23 22:06:12,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2019-11-23 22:06:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:12,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,361 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash -922392016, now seen corresponding path program 1 times [2019-11-23 22:06:12,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167236043] [2019-11-23 22:06:12,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167236043] [2019-11-23 22:06:12,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066130780] [2019-11-23 22:06:12,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,414 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand 3 states. [2019-11-23 22:06:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,449 INFO L93 Difference]: Finished difference Result 380 states and 664 transitions. [2019-11-23 22:06:12,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,452 INFO L225 Difference]: With dead ends: 380 [2019-11-23 22:06:12,452 INFO L226 Difference]: Without dead ends: 254 [2019-11-23 22:06:12,453 INFO L630 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-11-23 22:06:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-23 22:06:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-23 22:06:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-23 22:06:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 434 transitions. [2019-11-23 22:06:12,501 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 434 transitions. Word has length 18 [2019-11-23 22:06:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,501 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 434 transitions. [2019-11-23 22:06:12,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 434 transitions. [2019-11-23 22:06:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:12,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,507 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash -335586002, now seen corresponding path program 1 times [2019-11-23 22:06:12,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304397840] [2019-11-23 22:06:12,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304397840] [2019-11-23 22:06:12,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120813145] [2019-11-23 22:06:12,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,572 INFO L87 Difference]: Start difference. First operand 252 states and 434 transitions. Second operand 3 states. [2019-11-23 22:06:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,589 INFO L93 Difference]: Finished difference Result 320 states and 556 transitions. [2019-11-23 22:06:12,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,593 INFO L225 Difference]: With dead ends: 320 [2019-11-23 22:06:12,593 INFO L226 Difference]: Without dead ends: 318 [2019-11-23 22:06:12,593 INFO L630 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-11-23 22:06:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-23 22:06:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 252. [2019-11-23 22:06:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-23 22:06:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 430 transitions. [2019-11-23 22:06:12,604 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 430 transitions. Word has length 18 [2019-11-23 22:06:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,605 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 430 transitions. [2019-11-23 22:06:12,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 430 transitions. [2019-11-23 22:06:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:12,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,607 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1470832605, now seen corresponding path program 1 times [2019-11-23 22:06:12,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144062503] [2019-11-23 22:06:12,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144062503] [2019-11-23 22:06:12,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439739841] [2019-11-23 22:06:12,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,638 INFO L87 Difference]: Start difference. First operand 252 states and 430 transitions. Second operand 3 states. [2019-11-23 22:06:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,660 INFO L93 Difference]: Finished difference Result 468 states and 808 transitions. [2019-11-23 22:06:12,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,663 INFO L225 Difference]: With dead ends: 468 [2019-11-23 22:06:12,664 INFO L226 Difference]: Without dead ends: 466 [2019-11-23 22:06:12,664 INFO L630 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-11-23 22:06:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-23 22:06:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 352. [2019-11-23 22:06:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-23 22:06:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 590 transitions. [2019-11-23 22:06:12,677 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 590 transitions. Word has length 19 [2019-11-23 22:06:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,677 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 590 transitions. [2019-11-23 22:06:12,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 590 transitions. [2019-11-23 22:06:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:12,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,679 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash 884026591, now seen corresponding path program 1 times [2019-11-23 22:06:12,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212876587] [2019-11-23 22:06:12,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212876587] [2019-11-23 22:06:12,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887062519] [2019-11-23 22:06:12,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,722 INFO L87 Difference]: Start difference. First operand 352 states and 590 transitions. Second operand 3 states. [2019-11-23 22:06:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,751 INFO L93 Difference]: Finished difference Result 836 states and 1408 transitions. [2019-11-23 22:06:12,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:12,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,755 INFO L225 Difference]: With dead ends: 836 [2019-11-23 22:06:12,755 INFO L226 Difference]: Without dead ends: 490 [2019-11-23 22:06:12,759 INFO L630 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-11-23 22:06:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-23 22:06:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2019-11-23 22:06:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-23 22:06:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2019-11-23 22:06:12,784 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 19 [2019-11-23 22:06:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,786 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2019-11-23 22:06:12,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2019-11-23 22:06:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:12,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,788 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1648615131, now seen corresponding path program 1 times [2019-11-23 22:06:12,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97529454] [2019-11-23 22:06:12,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97529454] [2019-11-23 22:06:12,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106641839] [2019-11-23 22:06:12,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,832 INFO L87 Difference]: Start difference. First operand 488 states and 810 transitions. Second operand 3 states. [2019-11-23 22:06:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,859 INFO L93 Difference]: Finished difference Result 740 states and 1224 transitions. [2019-11-23 22:06:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,863 INFO L225 Difference]: With dead ends: 740 [2019-11-23 22:06:12,863 INFO L226 Difference]: Without dead ends: 502 [2019-11-23 22:06:12,864 INFO L630 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-11-23 22:06:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-23 22:06:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2019-11-23 22:06:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 22:06:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 818 transitions. [2019-11-23 22:06:12,881 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 818 transitions. Word has length 20 [2019-11-23 22:06:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,881 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 818 transitions. [2019-11-23 22:06:12,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 818 transitions. [2019-11-23 22:06:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:12,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,883 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1635234915, now seen corresponding path program 1 times [2019-11-23 22:06:12,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869727427] [2019-11-23 22:06:12,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:12,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869727427] [2019-11-23 22:06:12,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:12,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:12,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502014678] [2019-11-23 22:06:12,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:12,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:12,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:12,925 INFO L87 Difference]: Start difference. First operand 500 states and 818 transitions. Second operand 3 states. [2019-11-23 22:06:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:12,952 INFO L93 Difference]: Finished difference Result 904 states and 1500 transitions. [2019-11-23 22:06:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:12,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:12,957 INFO L225 Difference]: With dead ends: 904 [2019-11-23 22:06:12,957 INFO L226 Difference]: Without dead ends: 902 [2019-11-23 22:06:12,958 INFO L630 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-11-23 22:06:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-11-23 22:06:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 708. [2019-11-23 22:06:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-11-23 22:06:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1130 transitions. [2019-11-23 22:06:12,980 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1130 transitions. Word has length 20 [2019-11-23 22:06:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:12,980 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1130 transitions. [2019-11-23 22:06:12,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1130 transitions. [2019-11-23 22:06:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:12,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:12,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:12,982 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:12,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:12,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1048428901, now seen corresponding path program 1 times [2019-11-23 22:06:12,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:12,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868016372] [2019-11-23 22:06:12,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:13,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868016372] [2019-11-23 22:06:13,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:13,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:13,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578715147] [2019-11-23 22:06:13,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:13,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:13,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:13,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:13,007 INFO L87 Difference]: Start difference. First operand 708 states and 1130 transitions. Second operand 3 states. [2019-11-23 22:06:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:13,038 INFO L93 Difference]: Finished difference Result 1656 states and 2652 transitions. [2019-11-23 22:06:13,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:13,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:13,044 INFO L225 Difference]: With dead ends: 1656 [2019-11-23 22:06:13,044 INFO L226 Difference]: Without dead ends: 966 [2019-11-23 22:06:13,046 INFO L630 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-11-23 22:06:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-23 22:06:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-11-23 22:06:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-23 22:06:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1522 transitions. [2019-11-23 22:06:13,075 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1522 transitions. Word has length 20 [2019-11-23 22:06:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:13,075 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1522 transitions. [2019-11-23 22:06:13,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1522 transitions. [2019-11-23 22:06:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:13,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:13,080 INFO L410 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-11-23 22:06:13,080 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash -847110476, now seen corresponding path program 1 times [2019-11-23 22:06:13,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:13,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336283293] [2019-11-23 22:06:13,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:13,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336283293] [2019-11-23 22:06:13,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:13,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:13,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004965173] [2019-11-23 22:06:13,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:13,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:13,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:13,129 INFO L87 Difference]: Start difference. First operand 964 states and 1522 transitions. Second operand 3 states. [2019-11-23 22:06:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:13,153 INFO L93 Difference]: Finished difference Result 1448 states and 2276 transitions. [2019-11-23 22:06:13,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:13,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:13,160 INFO L225 Difference]: With dead ends: 1448 [2019-11-23 22:06:13,161 INFO L226 Difference]: Without dead ends: 982 [2019-11-23 22:06:13,163 INFO L630 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-11-23 22:06:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-11-23 22:06:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2019-11-23 22:06:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-11-23 22:06:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1522 transitions. [2019-11-23 22:06:13,209 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1522 transitions. Word has length 21 [2019-11-23 22:06:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:13,209 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1522 transitions. [2019-11-23 22:06:13,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1522 transitions. [2019-11-23 22:06:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:13,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:13,212 INFO L410 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-11-23 22:06:13,212 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1858227726, now seen corresponding path program 1 times [2019-11-23 22:06:13,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:13,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857401759] [2019-11-23 22:06:13,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:13,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857401759] [2019-11-23 22:06:13,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:13,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:13,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241648707] [2019-11-23 22:06:13,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:13,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:13,260 INFO L87 Difference]: Start difference. First operand 980 states and 1522 transitions. Second operand 3 states. [2019-11-23 22:06:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:13,311 INFO L93 Difference]: Finished difference Result 1736 states and 2740 transitions. [2019-11-23 22:06:13,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:13,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:13,323 INFO L225 Difference]: With dead ends: 1736 [2019-11-23 22:06:13,324 INFO L226 Difference]: Without dead ends: 1734 [2019-11-23 22:06:13,327 INFO L630 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-11-23 22:06:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-23 22:06:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1412. [2019-11-23 22:06:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-23 22:06:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2130 transitions. [2019-11-23 22:06:13,408 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2130 transitions. Word has length 21 [2019-11-23 22:06:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:13,409 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2130 transitions. [2019-11-23 22:06:13,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2130 transitions. [2019-11-23 22:06:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:13,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:13,413 INFO L410 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-11-23 22:06:13,413 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1849933556, now seen corresponding path program 1 times [2019-11-23 22:06:13,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:13,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409082446] [2019-11-23 22:06:13,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:13,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409082446] [2019-11-23 22:06:13,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:13,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:13,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690862655] [2019-11-23 22:06:13,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:13,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:13,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:13,450 INFO L87 Difference]: Start difference. First operand 1412 states and 2130 transitions. Second operand 3 states. [2019-11-23 22:06:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:13,493 INFO L93 Difference]: Finished difference Result 3272 states and 4948 transitions. [2019-11-23 22:06:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:13,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:13,505 INFO L225 Difference]: With dead ends: 3272 [2019-11-23 22:06:13,505 INFO L226 Difference]: Without dead ends: 1894 [2019-11-23 22:06:13,508 INFO L630 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-11-23 22:06:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-11-23 22:06:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2019-11-23 22:06:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2019-11-23 22:06:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2818 transitions. [2019-11-23 22:06:13,572 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2818 transitions. Word has length 21 [2019-11-23 22:06:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:13,573 INFO L462 AbstractCegarLoop]: Abstraction has 1892 states and 2818 transitions. [2019-11-23 22:06:13,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2818 transitions. [2019-11-23 22:06:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:13,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:13,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:13,576 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1770269606, now seen corresponding path program 1 times [2019-11-23 22:06:13,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:13,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476590868] [2019-11-23 22:06:13,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:13,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476590868] [2019-11-23 22:06:13,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:13,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:13,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831036975] [2019-11-23 22:06:13,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:13,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:13,601 INFO L87 Difference]: Start difference. First operand 1892 states and 2818 transitions. Second operand 3 states. [2019-11-23 22:06:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:13,639 INFO L93 Difference]: Finished difference Result 2840 states and 4212 transitions. [2019-11-23 22:06:13,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:13,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:13,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:13,649 INFO L225 Difference]: With dead ends: 2840 [2019-11-23 22:06:13,649 INFO L226 Difference]: Without dead ends: 1926 [2019-11-23 22:06:13,651 INFO L630 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-11-23 22:06:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-23 22:06:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2019-11-23 22:06:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-11-23 22:06:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2818 transitions. [2019-11-23 22:06:13,707 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2818 transitions. Word has length 22 [2019-11-23 22:06:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:13,707 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2818 transitions. [2019-11-23 22:06:13,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2818 transitions. [2019-11-23 22:06:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:13,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:13,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:13,710 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:13,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1513580440, now seen corresponding path program 1 times [2019-11-23 22:06:13,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:13,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422045783] [2019-11-23 22:06:13,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:13,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422045783] [2019-11-23 22:06:13,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:13,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:13,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94721472] [2019-11-23 22:06:13,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:13,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:13,740 INFO L87 Difference]: Start difference. First operand 1924 states and 2818 transitions. Second operand 3 states. [2019-11-23 22:06:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:13,817 INFO L93 Difference]: Finished difference Result 3336 states and 4964 transitions. [2019-11-23 22:06:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:13,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:13,836 INFO L225 Difference]: With dead ends: 3336 [2019-11-23 22:06:13,837 INFO L226 Difference]: Without dead ends: 3334 [2019-11-23 22:06:13,839 INFO L630 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-11-23 22:06:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-11-23 22:06:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2820. [2019-11-23 22:06:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-11-23 22:06:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4002 transitions. [2019-11-23 22:06:13,953 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4002 transitions. Word has length 22 [2019-11-23 22:06:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:13,953 INFO L462 AbstractCegarLoop]: Abstraction has 2820 states and 4002 transitions. [2019-11-23 22:06:13,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4002 transitions. [2019-11-23 22:06:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:13,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:13,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:13,960 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:13,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:13,961 INFO L82 PathProgramCache]: Analyzing trace with hash 926774426, now seen corresponding path program 1 times [2019-11-23 22:06:13,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:13,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112972608] [2019-11-23 22:06:13,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:13,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112972608] [2019-11-23 22:06:13,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:13,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:13,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672882533] [2019-11-23 22:06:13,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:13,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:13,990 INFO L87 Difference]: Start difference. First operand 2820 states and 4002 transitions. Second operand 3 states. [2019-11-23 22:06:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:14,091 INFO L93 Difference]: Finished difference Result 6472 states and 9188 transitions. [2019-11-23 22:06:14,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:14,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:14,109 INFO L225 Difference]: With dead ends: 6472 [2019-11-23 22:06:14,109 INFO L226 Difference]: Without dead ends: 3718 [2019-11-23 22:06:14,113 INFO L630 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-11-23 22:06:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-23 22:06:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2019-11-23 22:06:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2019-11-23 22:06:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 5186 transitions. [2019-11-23 22:06:14,226 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 5186 transitions. Word has length 22 [2019-11-23 22:06:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:14,226 INFO L462 AbstractCegarLoop]: Abstraction has 3716 states and 5186 transitions. [2019-11-23 22:06:14,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 5186 transitions. [2019-11-23 22:06:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:14,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:14,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:14,232 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:14,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash -323431223, now seen corresponding path program 1 times [2019-11-23 22:06:14,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:14,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449670818] [2019-11-23 22:06:14,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:14,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449670818] [2019-11-23 22:06:14,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:14,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:14,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130213170] [2019-11-23 22:06:14,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:14,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:14,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:14,269 INFO L87 Difference]: Start difference. First operand 3716 states and 5186 transitions. Second operand 3 states. [2019-11-23 22:06:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:14,337 INFO L93 Difference]: Finished difference Result 5576 states and 7748 transitions. [2019-11-23 22:06:14,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:14,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:14,356 INFO L225 Difference]: With dead ends: 5576 [2019-11-23 22:06:14,356 INFO L226 Difference]: Without dead ends: 3782 [2019-11-23 22:06:14,359 INFO L630 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-11-23 22:06:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2019-11-23 22:06:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3780. [2019-11-23 22:06:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-11-23 22:06:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5186 transitions. [2019-11-23 22:06:14,486 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5186 transitions. Word has length 23 [2019-11-23 22:06:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:14,486 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5186 transitions. [2019-11-23 22:06:14,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5186 transitions. [2019-11-23 22:06:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:14,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:14,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:14,519 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1334548473, now seen corresponding path program 1 times [2019-11-23 22:06:14,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:14,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297781763] [2019-11-23 22:06:14,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:14,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297781763] [2019-11-23 22:06:14,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:14,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:14,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445337627] [2019-11-23 22:06:14,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:14,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:14,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:14,544 INFO L87 Difference]: Start difference. First operand 3780 states and 5186 transitions. Second operand 3 states. [2019-11-23 22:06:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:14,630 INFO L93 Difference]: Finished difference Result 6408 states and 8900 transitions. [2019-11-23 22:06:14,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:14,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:14,673 INFO L225 Difference]: With dead ends: 6408 [2019-11-23 22:06:14,673 INFO L226 Difference]: Without dead ends: 6406 [2019-11-23 22:06:14,676 INFO L630 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-11-23 22:06:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2019-11-23 22:06:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5636. [2019-11-23 22:06:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-11-23 22:06:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7490 transitions. [2019-11-23 22:06:14,817 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7490 transitions. Word has length 23 [2019-11-23 22:06:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:14,818 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 7490 transitions. [2019-11-23 22:06:14,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7490 transitions. [2019-11-23 22:06:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:14,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:14,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:14,827 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1921354487, now seen corresponding path program 1 times [2019-11-23 22:06:14,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:14,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316040269] [2019-11-23 22:06:14,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:14,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316040269] [2019-11-23 22:06:14,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:14,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:14,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815864413] [2019-11-23 22:06:14,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:14,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:14,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:14,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:14,859 INFO L87 Difference]: Start difference. First operand 5636 states and 7490 transitions. Second operand 3 states. [2019-11-23 22:06:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:14,981 INFO L93 Difference]: Finished difference Result 12808 states and 16964 transitions. [2019-11-23 22:06:14,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:14,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:14,995 INFO L225 Difference]: With dead ends: 12808 [2019-11-23 22:06:14,996 INFO L226 Difference]: Without dead ends: 7302 [2019-11-23 22:06:15,005 INFO L630 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-11-23 22:06:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-11-23 22:06:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7300. [2019-11-23 22:06:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2019-11-23 22:06:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 9474 transitions. [2019-11-23 22:06:15,247 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 9474 transitions. Word has length 23 [2019-11-23 22:06:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:15,247 INFO L462 AbstractCegarLoop]: Abstraction has 7300 states and 9474 transitions. [2019-11-23 22:06:15,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 9474 transitions. [2019-11-23 22:06:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:15,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:15,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:15,261 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1578886031, now seen corresponding path program 1 times [2019-11-23 22:06:15,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:15,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690012650] [2019-11-23 22:06:15,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:15,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690012650] [2019-11-23 22:06:15,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:15,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:15,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093047174] [2019-11-23 22:06:15,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:15,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:15,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:15,290 INFO L87 Difference]: Start difference. First operand 7300 states and 9474 transitions. Second operand 3 states. [2019-11-23 22:06:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:15,383 INFO L93 Difference]: Finished difference Result 10952 states and 14148 transitions. [2019-11-23 22:06:15,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:15,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:15,396 INFO L225 Difference]: With dead ends: 10952 [2019-11-23 22:06:15,396 INFO L226 Difference]: Without dead ends: 7430 [2019-11-23 22:06:15,402 INFO L630 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-11-23 22:06:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2019-11-23 22:06:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 7428. [2019-11-23 22:06:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7428 states. [2019-11-23 22:06:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 9474 transitions. [2019-11-23 22:06:15,621 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 9474 transitions. Word has length 24 [2019-11-23 22:06:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:15,621 INFO L462 AbstractCegarLoop]: Abstraction has 7428 states and 9474 transitions. [2019-11-23 22:06:15,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 9474 transitions. [2019-11-23 22:06:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:15,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:15,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:15,630 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash 567768781, now seen corresponding path program 1 times [2019-11-23 22:06:15,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:15,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96568957] [2019-11-23 22:06:15,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:15,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96568957] [2019-11-23 22:06:15,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:15,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:15,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998890137] [2019-11-23 22:06:15,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:15,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:15,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:15,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:15,647 INFO L87 Difference]: Start difference. First operand 7428 states and 9474 transitions. Second operand 3 states. [2019-11-23 22:06:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:15,812 INFO L93 Difference]: Finished difference Result 12296 states and 15748 transitions. [2019-11-23 22:06:15,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:15,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:15,835 INFO L225 Difference]: With dead ends: 12296 [2019-11-23 22:06:15,835 INFO L226 Difference]: Without dead ends: 12294 [2019-11-23 22:06:15,839 INFO L630 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-11-23 22:06:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2019-11-23 22:06:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11268. [2019-11-23 22:06:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2019-11-23 22:06:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13954 transitions. [2019-11-23 22:06:16,109 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13954 transitions. Word has length 24 [2019-11-23 22:06:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:16,110 INFO L462 AbstractCegarLoop]: Abstraction has 11268 states and 13954 transitions. [2019-11-23 22:06:16,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13954 transitions. [2019-11-23 22:06:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:16,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:16,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:16,135 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash -19037233, now seen corresponding path program 1 times [2019-11-23 22:06:16,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:16,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790966292] [2019-11-23 22:06:16,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:16,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790966292] [2019-11-23 22:06:16,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:16,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:16,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004432896] [2019-11-23 22:06:16,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:16,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:16,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:16,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:16,241 INFO L87 Difference]: Start difference. First operand 11268 states and 13954 transitions. Second operand 3 states. [2019-11-23 22:06:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:16,521 INFO L93 Difference]: Finished difference Result 25352 states and 31108 transitions. [2019-11-23 22:06:16,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:16,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:16,558 INFO L225 Difference]: With dead ends: 25352 [2019-11-23 22:06:16,558 INFO L226 Difference]: Without dead ends: 14342 [2019-11-23 22:06:16,579 INFO L630 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-11-23 22:06:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2019-11-23 22:06:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 14340. [2019-11-23 22:06:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-11-23 22:06:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 17154 transitions. [2019-11-23 22:06:17,182 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 17154 transitions. Word has length 24 [2019-11-23 22:06:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:17,182 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 17154 transitions. [2019-11-23 22:06:17,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 17154 transitions. [2019-11-23 22:06:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:17,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:17,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:17,200 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash 421179102, now seen corresponding path program 1 times [2019-11-23 22:06:17,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:17,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179878633] [2019-11-23 22:06:17,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:17,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179878633] [2019-11-23 22:06:17,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:17,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:17,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022088492] [2019-11-23 22:06:17,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:17,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:17,225 INFO L87 Difference]: Start difference. First operand 14340 states and 17154 transitions. Second operand 3 states. [2019-11-23 22:06:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:17,406 INFO L93 Difference]: Finished difference Result 21512 states and 25604 transitions. [2019-11-23 22:06:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:17,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:17,432 INFO L225 Difference]: With dead ends: 21512 [2019-11-23 22:06:17,432 INFO L226 Difference]: Without dead ends: 14598 [2019-11-23 22:06:17,444 INFO L630 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-11-23 22:06:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2019-11-23 22:06:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2019-11-23 22:06:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14596 states. [2019-11-23 22:06:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 17154 transitions. [2019-11-23 22:06:18,308 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 17154 transitions. Word has length 25 [2019-11-23 22:06:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:18,308 INFO L462 AbstractCegarLoop]: Abstraction has 14596 states and 17154 transitions. [2019-11-23 22:06:18,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 17154 transitions. [2019-11-23 22:06:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:18,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:18,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:18,328 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:18,329 INFO L82 PathProgramCache]: Analyzing trace with hash -589938148, now seen corresponding path program 1 times [2019-11-23 22:06:18,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:18,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33651370] [2019-11-23 22:06:18,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:18,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33651370] [2019-11-23 22:06:18,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:18,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:18,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460011425] [2019-11-23 22:06:18,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:18,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:18,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:18,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:18,349 INFO L87 Difference]: Start difference. First operand 14596 states and 17154 transitions. Second operand 3 states. [2019-11-23 22:06:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:18,625 INFO L93 Difference]: Finished difference Result 23558 states and 27395 transitions. [2019-11-23 22:06:18,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:18,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:18,667 INFO L225 Difference]: With dead ends: 23558 [2019-11-23 22:06:18,667 INFO L226 Difference]: Without dead ends: 23556 [2019-11-23 22:06:18,675 INFO L630 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-11-23 22:06:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23556 states. [2019-11-23 22:06:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23556 to 22532. [2019-11-23 22:06:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-11-23 22:06:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 25858 transitions. [2019-11-23 22:06:19,191 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 25858 transitions. Word has length 25 [2019-11-23 22:06:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:19,192 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 25858 transitions. [2019-11-23 22:06:19,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 25858 transitions. [2019-11-23 22:06:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:19,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:19,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:19,222 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1176744162, now seen corresponding path program 1 times [2019-11-23 22:06:19,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:19,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810844794] [2019-11-23 22:06:19,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:19,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810844794] [2019-11-23 22:06:19,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:19,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:19,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874897236] [2019-11-23 22:06:19,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:19,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:19,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:19,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:19,249 INFO L87 Difference]: Start difference. First operand 22532 states and 25858 transitions. Second operand 3 states. [2019-11-23 22:06:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:19,591 INFO L93 Difference]: Finished difference Result 50180 states and 56578 transitions. [2019-11-23 22:06:19,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:19,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:19,592 INFO L225 Difference]: With dead ends: 50180 [2019-11-23 22:06:19,592 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:06:19,633 INFO L630 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-11-23 22:06:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:06:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:06:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:06:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:06:19,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-23 22:06:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:19,634 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:06:19,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:06:19,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:06:19,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:06:19,660 INFO L447 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-11-23 22:06:19,660 INFO L444 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,660 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,660 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,660 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L444 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L444 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L444 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,661 INFO L447 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-11-23 22:06:19,661 INFO L447 ceAbstractionStarter]: At program point L162(lines 4 163) the Hoare annotation is: true [2019-11-23 22:06:19,662 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-23 22:06:19,662 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 22:06:19,662 INFO L440 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-11-23 22:06:19,662 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,662 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,662 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-23 22:06:19,662 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 22:06:19,662 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,662 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,663 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,664 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-11-23 22:06:19,664 INFO L444 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,664 INFO L444 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,664 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-23 22:06:19,665 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,665 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-23 22:06:19,665 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:06:19,665 INFO L444 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,665 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 22:06:19,665 INFO L444 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-23 22:06:19,665 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,665 INFO L444 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-11-23 22:06:19,666 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 22:06:19,666 INFO L444 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-11-23 22:06:19,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:06:19 BoogieIcfgContainer [2019-11-23 22:06:19,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:06:19,683 INFO L168 Benchmark]: Toolchain (without parser) took 9229.16 ms. Allocated memory was 140.5 MB in the beginning and 611.3 MB in the end (delta: 470.8 MB). Free memory was 101.7 MB in the beginning and 219.8 MB in the end (delta: -118.1 MB). Peak memory consumption was 352.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:19,686 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 22:06:19,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 446.91 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 183.6 MB in the end (delta: -82.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:19,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.73 ms. Allocated memory is still 204.5 MB. Free memory was 183.6 MB in the beginning and 181.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:19,692 INFO L168 Benchmark]: Boogie Preprocessor took 25.60 ms. Allocated memory is still 204.5 MB. Free memory was 181.6 MB in the beginning and 179.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:19,692 INFO L168 Benchmark]: RCFGBuilder took 398.21 ms. Allocated memory is still 204.5 MB. Free memory was 179.9 MB in the beginning and 161.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:19,695 INFO L168 Benchmark]: TraceAbstraction took 8313.02 ms. Allocated memory was 204.5 MB in the beginning and 611.3 MB in the end (delta: 406.8 MB). Free memory was 160.3 MB in the beginning and 219.8 MB in the end (delta: -59.5 MB). Peak memory consumption was 347.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:19,699 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.20 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 446.91 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 183.6 MB in the end (delta: -82.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.73 ms. Allocated memory is still 204.5 MB. Free memory was 183.6 MB in the beginning and 181.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.60 ms. Allocated memory is still 204.5 MB. Free memory was 181.6 MB in the beginning and 179.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 398.21 ms. Allocated memory is still 204.5 MB. Free memory was 179.9 MB in the beginning and 161.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8313.02 ms. Allocated memory was 204.5 MB in the beginning and 611.3 MB in the end (delta: 406.8 MB). Free memory was 160.3 MB in the beginning and 219.8 MB in the end (delta: -59.5 MB). Peak memory consumption was 347.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. Result: SAFE, OverallTime: 8.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2276 SDtfs, 1149 SDslu, 1505 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22532occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 24156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...