/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_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:45,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:45,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:45,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:45,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:45,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:45,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:45,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:45,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:45,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:45,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:45,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:45,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:45,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:45,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:45,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:45,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:45,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:45,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:45,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:45,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:45,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:45,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:45,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:45,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:45,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:45,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:45,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:45,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:45,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:45,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:45,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:45,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:45,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:45,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:45,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:45,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:45,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:45,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:45,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:45,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:45,458 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:45,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:45,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:45,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:45,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:45,474 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:45,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:45,474 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:45,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:45,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:45,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:45,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:45,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:45,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:45,476 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:45,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:45,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:45,476 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:45,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:45,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:45,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:45,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:45,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:45,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:45,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:45,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:45,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:45,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:45,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:45,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:45,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:45,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:45,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:45,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:45,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:45,798 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:45,799 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2019-11-23 22:06:45,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134a6d3c3/a2ec00cd55fd44479f3e88b55c01439c/FLAG19c2ea80b [2019-11-23 22:06:46,318 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:46,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2019-11-23 22:06:46,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134a6d3c3/a2ec00cd55fd44479f3e88b55c01439c/FLAG19c2ea80b [2019-11-23 22:06:46,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134a6d3c3/a2ec00cd55fd44479f3e88b55c01439c [2019-11-23 22:06:46,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:46,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:46,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:46,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:46,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:46,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:46" (1/1) ... [2019-11-23 22:06:46,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7903bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:46, skipping insertion in model container [2019-11-23 22:06:46,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:46" (1/1) ... [2019-11-23 22:06:46,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:46,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:46,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:46,905 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:46,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:47,028 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:47,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:47 WrapperNode [2019-11-23 22:06:47,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:47,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:47,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:47,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:47,036 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:47" (1/1) ... [2019-11-23 22:06:47,042 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:47" (1/1) ... [2019-11-23 22:06:47,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:47,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:47,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:47,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:47,077 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:47" (1/1) ... [2019-11-23 22:06:47,077 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:47" (1/1) ... [2019-11-23 22:06:47,079 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:47" (1/1) ... [2019-11-23 22:06:47,079 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:47" (1/1) ... [2019-11-23 22:06:47,083 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:47" (1/1) ... [2019-11-23 22:06:47,090 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:47" (1/1) ... [2019-11-23 22:06:47,092 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:47" (1/1) ... [2019-11-23 22:06:47,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:47,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:47,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:47,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:47,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:47" (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:47,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:47,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:47,550 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:47,550 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:47,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:47 BoogieIcfgContainer [2019-11-23 22:06:47,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:47,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:47,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:47,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:47,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:46" (1/3) ... [2019-11-23 22:06:47,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da45119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:47, skipping insertion in model container [2019-11-23 22:06:47,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:47" (2/3) ... [2019-11-23 22:06:47,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da45119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:47, skipping insertion in model container [2019-11-23 22:06:47,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:47" (3/3) ... [2019-11-23 22:06:47,559 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-11-23 22:06:47,571 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:47,577 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:47,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:47,617 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:47,617 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:47,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:47,618 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:47,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:47,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:47,618 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:47,619 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-11-23 22:06:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:47,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:47,646 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:47,647 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:47,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1323177046, now seen corresponding path program 1 times [2019-11-23 22:06:47,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:47,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080467614] [2019-11-23 22:06:47,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:47,896 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:47,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080467614] [2019-11-23 22:06:47,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:47,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:47,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303151520] [2019-11-23 22:06:47,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:47,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:47,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:47,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:47,926 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2019-11-23 22:06:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:48,007 INFO L93 Difference]: Finished difference Result 112 states and 204 transitions. [2019-11-23 22:06:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:48,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:48,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:48,024 INFO L225 Difference]: With dead ends: 112 [2019-11-23 22:06:48,024 INFO L226 Difference]: Without dead ends: 98 [2019-11-23 22:06:48,029 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:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-23 22:06:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2019-11-23 22:06:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 22:06:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 125 transitions. [2019-11-23 22:06:48,111 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 125 transitions. Word has length 21 [2019-11-23 22:06:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:48,112 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 125 transitions. [2019-11-23 22:06:48,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 125 transitions. [2019-11-23 22:06:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:48,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:48,115 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:48,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:48,116 INFO L82 PathProgramCache]: Analyzing trace with hash -670967660, now seen corresponding path program 1 times [2019-11-23 22:06:48,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:48,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895274300] [2019-11-23 22:06:48,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:48,239 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:48,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895274300] [2019-11-23 22:06:48,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:48,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:48,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423739187] [2019-11-23 22:06:48,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:48,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:48,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:48,243 INFO L87 Difference]: Start difference. First operand 66 states and 125 transitions. Second operand 3 states. [2019-11-23 22:06:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:48,283 INFO L93 Difference]: Finished difference Result 163 states and 308 transitions. [2019-11-23 22:06:48,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:48,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:48,288 INFO L225 Difference]: With dead ends: 163 [2019-11-23 22:06:48,288 INFO L226 Difference]: Without dead ends: 98 [2019-11-23 22:06:48,290 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:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-23 22:06:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-23 22:06:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-23 22:06:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 181 transitions. [2019-11-23 22:06:48,305 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 181 transitions. Word has length 21 [2019-11-23 22:06:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:48,305 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 181 transitions. [2019-11-23 22:06:48,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 181 transitions. [2019-11-23 22:06:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:48,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:48,307 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:48,307 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1930972807, now seen corresponding path program 1 times [2019-11-23 22:06:48,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:48,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341473367] [2019-11-23 22:06:48,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:48,370 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:48,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341473367] [2019-11-23 22:06:48,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:48,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:48,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670876412] [2019-11-23 22:06:48,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:48,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:48,373 INFO L87 Difference]: Start difference. First operand 96 states and 181 transitions. Second operand 3 states. [2019-11-23 22:06:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:48,400 INFO L93 Difference]: Finished difference Result 149 states and 275 transitions. [2019-11-23 22:06:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:48,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:48,403 INFO L225 Difference]: With dead ends: 149 [2019-11-23 22:06:48,403 INFO L226 Difference]: Without dead ends: 101 [2019-11-23 22:06:48,408 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:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-23 22:06:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-23 22:06:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-23 22:06:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 183 transitions. [2019-11-23 22:06:48,429 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 183 transitions. Word has length 22 [2019-11-23 22:06:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:48,430 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 183 transitions. [2019-11-23 22:06:48,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 183 transitions. [2019-11-23 22:06:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:48,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:48,433 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:48,434 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash 675050747, now seen corresponding path program 1 times [2019-11-23 22:06:48,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:48,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856545012] [2019-11-23 22:06:48,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:48,525 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:48,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856545012] [2019-11-23 22:06:48,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:48,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:48,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187998442] [2019-11-23 22:06:48,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:48,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:48,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:48,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:48,529 INFO L87 Difference]: Start difference. First operand 99 states and 183 transitions. Second operand 3 states. [2019-11-23 22:06:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:48,566 INFO L93 Difference]: Finished difference Result 192 states and 356 transitions. [2019-11-23 22:06:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:48,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:48,571 INFO L225 Difference]: With dead ends: 192 [2019-11-23 22:06:48,571 INFO L226 Difference]: Without dead ends: 190 [2019-11-23 22:06:48,572 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:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-23 22:06:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 132. [2019-11-23 22:06:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-23 22:06:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 244 transitions. [2019-11-23 22:06:48,584 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 244 transitions. Word has length 22 [2019-11-23 22:06:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:48,584 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 244 transitions. [2019-11-23 22:06:48,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 244 transitions. [2019-11-23 22:06:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:48,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:48,586 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:48,587 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:48,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1319093959, now seen corresponding path program 1 times [2019-11-23 22:06:48,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:48,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220739117] [2019-11-23 22:06:48,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:48,649 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:48,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220739117] [2019-11-23 22:06:48,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:48,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:48,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658780005] [2019-11-23 22:06:48,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:48,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:48,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:48,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:48,654 INFO L87 Difference]: Start difference. First operand 132 states and 244 transitions. Second operand 3 states. [2019-11-23 22:06:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:48,685 INFO L93 Difference]: Finished difference Result 320 states and 594 transitions. [2019-11-23 22:06:48,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:48,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:48,687 INFO L225 Difference]: With dead ends: 320 [2019-11-23 22:06:48,687 INFO L226 Difference]: Without dead ends: 192 [2019-11-23 22:06:48,690 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:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-23 22:06:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-11-23 22:06:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-23 22:06:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 350 transitions. [2019-11-23 22:06:48,720 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 350 transitions. Word has length 22 [2019-11-23 22:06:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:48,721 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 350 transitions. [2019-11-23 22:06:48,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 350 transitions. [2019-11-23 22:06:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:48,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:48,725 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:48,726 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash -548051255, now seen corresponding path program 1 times [2019-11-23 22:06:48,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:48,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359648410] [2019-11-23 22:06:48,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:48,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359648410] [2019-11-23 22:06:48,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:48,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:48,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316580022] [2019-11-23 22:06:48,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:48,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:48,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:48,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:48,778 INFO L87 Difference]: Start difference. First operand 190 states and 350 transitions. Second operand 3 states. [2019-11-23 22:06:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:48,802 INFO L93 Difference]: Finished difference Result 287 states and 525 transitions. [2019-11-23 22:06:48,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:48,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:48,804 INFO L225 Difference]: With dead ends: 287 [2019-11-23 22:06:48,805 INFO L226 Difference]: Without dead ends: 194 [2019-11-23 22:06:48,806 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:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-23 22:06:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2019-11-23 22:06:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-23 22:06:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 350 transitions. [2019-11-23 22:06:48,823 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 350 transitions. Word has length 23 [2019-11-23 22:06:48,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:48,824 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 350 transitions. [2019-11-23 22:06:48,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 350 transitions. [2019-11-23 22:06:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:48,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:48,832 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:48,832 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:48,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:48,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2057972299, now seen corresponding path program 1 times [2019-11-23 22:06:48,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:48,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66802328] [2019-11-23 22:06:48,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:48,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66802328] [2019-11-23 22:06:48,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:48,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:48,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927853581] [2019-11-23 22:06:48,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:48,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:48,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:48,876 INFO L87 Difference]: Start difference. First operand 192 states and 350 transitions. Second operand 3 states. [2019-11-23 22:06:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:48,906 INFO L93 Difference]: Finished difference Result 560 states and 1024 transitions. [2019-11-23 22:06:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:48,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:48,909 INFO L225 Difference]: With dead ends: 560 [2019-11-23 22:06:48,909 INFO L226 Difference]: Without dead ends: 374 [2019-11-23 22:06:48,910 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:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-11-23 22:06:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2019-11-23 22:06:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-23 22:06:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 674 transitions. [2019-11-23 22:06:48,923 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 674 transitions. Word has length 23 [2019-11-23 22:06:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:48,923 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 674 transitions. [2019-11-23 22:06:48,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 674 transitions. [2019-11-23 22:06:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:48,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:48,925 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:48,926 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash -242850291, now seen corresponding path program 1 times [2019-11-23 22:06:48,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:48,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161288361] [2019-11-23 22:06:48,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:48,962 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:48,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161288361] [2019-11-23 22:06:48,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:48,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:48,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060984427] [2019-11-23 22:06:48,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:48,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:48,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:48,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:48,965 INFO L87 Difference]: Start difference. First operand 372 states and 674 transitions. Second operand 3 states. [2019-11-23 22:06:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:48,993 INFO L93 Difference]: Finished difference Result 480 states and 876 transitions. [2019-11-23 22:06:48,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:48,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:48,997 INFO L225 Difference]: With dead ends: 480 [2019-11-23 22:06:48,997 INFO L226 Difference]: Without dead ends: 478 [2019-11-23 22:06:48,998 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:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-23 22:06:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 372. [2019-11-23 22:06:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-23 22:06:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 670 transitions. [2019-11-23 22:06:49,011 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 670 transitions. Word has length 23 [2019-11-23 22:06:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,011 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 670 transitions. [2019-11-23 22:06:49,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 670 transitions. [2019-11-23 22:06:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:49,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,012 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:49,013 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash -627155762, now seen corresponding path program 1 times [2019-11-23 22:06:49,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116650755] [2019-11-23 22:06:49,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,050 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:49,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116650755] [2019-11-23 22:06:49,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388459094] [2019-11-23 22:06:49,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,058 INFO L87 Difference]: Start difference. First operand 372 states and 670 transitions. Second operand 3 states. [2019-11-23 22:06:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:49,085 INFO L93 Difference]: Finished difference Result 708 states and 1288 transitions. [2019-11-23 22:06:49,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:49,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:49,091 INFO L225 Difference]: With dead ends: 708 [2019-11-23 22:06:49,091 INFO L226 Difference]: Without dead ends: 706 [2019-11-23 22:06:49,092 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:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-11-23 22:06:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 512. [2019-11-23 22:06:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-23 22:06:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 910 transitions. [2019-11-23 22:06:49,120 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 910 transitions. Word has length 24 [2019-11-23 22:06:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,120 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 910 transitions. [2019-11-23 22:06:49,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 910 transitions. [2019-11-23 22:06:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:49,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,122 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:49,122 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1673666828, now seen corresponding path program 1 times [2019-11-23 22:06:49,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61310115] [2019-11-23 22:06:49,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,162 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:49,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61310115] [2019-11-23 22:06:49,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158528448] [2019-11-23 22:06:49,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,166 INFO L87 Difference]: Start difference. First operand 512 states and 910 transitions. Second operand 3 states. [2019-11-23 22:06:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:49,200 INFO L93 Difference]: Finished difference Result 1236 states and 2208 transitions. [2019-11-23 22:06:49,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:49,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:49,205 INFO L225 Difference]: With dead ends: 1236 [2019-11-23 22:06:49,205 INFO L226 Difference]: Without dead ends: 730 [2019-11-23 22:06:49,206 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:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-23 22:06:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 728. [2019-11-23 22:06:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-23 22:06:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1290 transitions. [2019-11-23 22:06:49,239 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1290 transitions. Word has length 24 [2019-11-23 22:06:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,248 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 1290 transitions. [2019-11-23 22:06:49,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1290 transitions. [2019-11-23 22:06:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:49,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,253 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:49,253 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2033220608, now seen corresponding path program 1 times [2019-11-23 22:06:49,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058714415] [2019-11-23 22:06:49,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,303 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:49,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058714415] [2019-11-23 22:06:49,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339138014] [2019-11-23 22:06:49,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,305 INFO L87 Difference]: Start difference. First operand 728 states and 1290 transitions. Second operand 3 states. [2019-11-23 22:06:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:49,336 INFO L93 Difference]: Finished difference Result 1100 states and 1944 transitions. [2019-11-23 22:06:49,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:49,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:49,341 INFO L225 Difference]: With dead ends: 1100 [2019-11-23 22:06:49,342 INFO L226 Difference]: Without dead ends: 742 [2019-11-23 22:06:49,343 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:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-11-23 22:06:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2019-11-23 22:06:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-11-23 22:06:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1298 transitions. [2019-11-23 22:06:49,368 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1298 transitions. Word has length 25 [2019-11-23 22:06:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,368 INFO L462 AbstractCegarLoop]: Abstraction has 740 states and 1298 transitions. [2019-11-23 22:06:49,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1298 transitions. [2019-11-23 22:06:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:49,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,371 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:49,371 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash 344276866, now seen corresponding path program 1 times [2019-11-23 22:06:49,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355258542] [2019-11-23 22:06:49,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,409 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:49,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355258542] [2019-11-23 22:06:49,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102683166] [2019-11-23 22:06:49,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,413 INFO L87 Difference]: Start difference. First operand 740 states and 1298 transitions. Second operand 3 states. [2019-11-23 22:06:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:49,442 INFO L93 Difference]: Finished difference Result 1384 states and 2460 transitions. [2019-11-23 22:06:49,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:49,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:49,450 INFO L225 Difference]: With dead ends: 1384 [2019-11-23 22:06:49,451 INFO L226 Difference]: Without dead ends: 1382 [2019-11-23 22:06:49,452 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:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-11-23 22:06:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1028. [2019-11-23 22:06:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-11-23 22:06:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1770 transitions. [2019-11-23 22:06:49,486 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1770 transitions. Word has length 25 [2019-11-23 22:06:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,487 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1770 transitions. [2019-11-23 22:06:49,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1770 transitions. [2019-11-23 22:06:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:49,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,489 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:49,490 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1649867840, now seen corresponding path program 1 times [2019-11-23 22:06:49,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209767931] [2019-11-23 22:06:49,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,514 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:49,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209767931] [2019-11-23 22:06:49,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468401344] [2019-11-23 22:06:49,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,517 INFO L87 Difference]: Start difference. First operand 1028 states and 1770 transitions. Second operand 3 states. [2019-11-23 22:06:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:49,550 INFO L93 Difference]: Finished difference Result 2456 states and 4252 transitions. [2019-11-23 22:06:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:49,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:49,558 INFO L225 Difference]: With dead ends: 2456 [2019-11-23 22:06:49,558 INFO L226 Difference]: Without dead ends: 1446 [2019-11-23 22:06:49,560 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:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2019-11-23 22:06:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1444. [2019-11-23 22:06:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-11-23 22:06:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2482 transitions. [2019-11-23 22:06:49,624 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2482 transitions. Word has length 25 [2019-11-23 22:06:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,625 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 2482 transitions. [2019-11-23 22:06:49,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2482 transitions. [2019-11-23 22:06:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:49,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,667 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, 1] [2019-11-23 22:06:49,667 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2082861345, now seen corresponding path program 1 times [2019-11-23 22:06:49,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437158115] [2019-11-23 22:06:49,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,717 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:49,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437158115] [2019-11-23 22:06:49,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941592473] [2019-11-23 22:06:49,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,720 INFO L87 Difference]: Start difference. First operand 1444 states and 2482 transitions. Second operand 3 states. [2019-11-23 22:06:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:49,754 INFO L93 Difference]: Finished difference Result 2168 states and 3716 transitions. [2019-11-23 22:06:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:49,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:49,765 INFO L225 Difference]: With dead ends: 2168 [2019-11-23 22:06:49,766 INFO L226 Difference]: Without dead ends: 1462 [2019-11-23 22:06:49,768 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:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-11-23 22:06:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2019-11-23 22:06:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-11-23 22:06:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2482 transitions. [2019-11-23 22:06:49,823 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2482 transitions. Word has length 26 [2019-11-23 22:06:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,823 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2482 transitions. [2019-11-23 22:06:49,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2482 transitions. [2019-11-23 22:06:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:49,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,826 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, 1] [2019-11-23 22:06:49,826 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,826 INFO L82 PathProgramCache]: Analyzing trace with hash 393917603, now seen corresponding path program 1 times [2019-11-23 22:06:49,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763063638] [2019-11-23 22:06:49,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,847 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:49,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763063638] [2019-11-23 22:06:49,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432585231] [2019-11-23 22:06:49,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,849 INFO L87 Difference]: Start difference. First operand 1460 states and 2482 transitions. Second operand 3 states. [2019-11-23 22:06:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:49,892 INFO L93 Difference]: Finished difference Result 2696 states and 4660 transitions. [2019-11-23 22:06:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:49,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:49,906 INFO L225 Difference]: With dead ends: 2696 [2019-11-23 22:06:49,906 INFO L226 Difference]: Without dead ends: 2694 [2019-11-23 22:06:49,907 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:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-11-23 22:06:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2052. [2019-11-23 22:06:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-23 22:06:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3410 transitions. [2019-11-23 22:06:49,962 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3410 transitions. Word has length 26 [2019-11-23 22:06:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,962 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3410 transitions. [2019-11-23 22:06:49,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3410 transitions. [2019-11-23 22:06:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:49,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,965 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, 1] [2019-11-23 22:06:49,966 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1600227103, now seen corresponding path program 1 times [2019-11-23 22:06:49,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949735319] [2019-11-23 22:06:49,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,989 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:49,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949735319] [2019-11-23 22:06:49,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298443975] [2019-11-23 22:06:49,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,991 INFO L87 Difference]: Start difference. First operand 2052 states and 3410 transitions. Second operand 3 states. [2019-11-23 22:06:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,041 INFO L93 Difference]: Finished difference Result 4872 states and 8148 transitions. [2019-11-23 22:06:50,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,055 INFO L225 Difference]: With dead ends: 4872 [2019-11-23 22:06:50,056 INFO L226 Difference]: Without dead ends: 2854 [2019-11-23 22:06:50,059 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:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2019-11-23 22:06:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2852. [2019-11-23 22:06:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-23 22:06:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4738 transitions. [2019-11-23 22:06:50,153 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4738 transitions. Word has length 26 [2019-11-23 22:06:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,154 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 4738 transitions. [2019-11-23 22:06:50,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4738 transitions. [2019-11-23 22:06:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:50,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,157 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, 1, 1] [2019-11-23 22:06:50,158 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,158 INFO L82 PathProgramCache]: Analyzing trace with hash -673242763, now seen corresponding path program 1 times [2019-11-23 22:06:50,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690140777] [2019-11-23 22:06:50,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:50,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690140777] [2019-11-23 22:06:50,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813376546] [2019-11-23 22:06:50,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,190 INFO L87 Difference]: Start difference. First operand 2852 states and 4738 transitions. Second operand 3 states. [2019-11-23 22:06:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,259 INFO L93 Difference]: Finished difference Result 4280 states and 7092 transitions. [2019-11-23 22:06:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,277 INFO L225 Difference]: With dead ends: 4280 [2019-11-23 22:06:50,277 INFO L226 Difference]: Without dead ends: 2886 [2019-11-23 22:06:50,282 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:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-11-23 22:06:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2884. [2019-11-23 22:06:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2884 states. [2019-11-23 22:06:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4738 transitions. [2019-11-23 22:06:50,405 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4738 transitions. Word has length 27 [2019-11-23 22:06:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,405 INFO L462 AbstractCegarLoop]: Abstraction has 2884 states and 4738 transitions. [2019-11-23 22:06:50,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4738 transitions. [2019-11-23 22:06:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:50,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,410 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, 1, 1] [2019-11-23 22:06:50,410 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1932780791, now seen corresponding path program 1 times [2019-11-23 22:06:50,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234943147] [2019-11-23 22:06:50,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,438 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:50,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234943147] [2019-11-23 22:06:50,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299610271] [2019-11-23 22:06:50,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,441 INFO L87 Difference]: Start difference. First operand 2884 states and 4738 transitions. Second operand 3 states. [2019-11-23 22:06:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,508 INFO L93 Difference]: Finished difference Result 5256 states and 8804 transitions. [2019-11-23 22:06:50,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,536 INFO L225 Difference]: With dead ends: 5256 [2019-11-23 22:06:50,536 INFO L226 Difference]: Without dead ends: 5254 [2019-11-23 22:06:50,539 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:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2019-11-23 22:06:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 4100. [2019-11-23 22:06:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-11-23 22:06:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 6562 transitions. [2019-11-23 22:06:50,656 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 6562 transitions. Word has length 27 [2019-11-23 22:06:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,656 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 6562 transitions. [2019-11-23 22:06:50,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6562 transitions. [2019-11-23 22:06:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:50,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,663 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, 1, 1] [2019-11-23 22:06:50,663 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash -61363915, now seen corresponding path program 1 times [2019-11-23 22:06:50,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420001862] [2019-11-23 22:06:50,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,688 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:50,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420001862] [2019-11-23 22:06:50,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135541200] [2019-11-23 22:06:50,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,690 INFO L87 Difference]: Start difference. First operand 4100 states and 6562 transitions. Second operand 3 states. [2019-11-23 22:06:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:50,801 INFO L93 Difference]: Finished difference Result 9672 states and 15588 transitions. [2019-11-23 22:06:50,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:50,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:50,840 INFO L225 Difference]: With dead ends: 9672 [2019-11-23 22:06:50,840 INFO L226 Difference]: Without dead ends: 5638 [2019-11-23 22:06:50,846 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:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-11-23 22:06:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5636. [2019-11-23 22:06:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-11-23 22:06:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 9026 transitions. [2019-11-23 22:06:51,034 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 9026 transitions. Word has length 27 [2019-11-23 22:06:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,035 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 9026 transitions. [2019-11-23 22:06:51,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 9026 transitions. [2019-11-23 22:06:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:51,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,041 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, 1, 1, 1] [2019-11-23 22:06:51,041 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash -213123850, now seen corresponding path program 1 times [2019-11-23 22:06:51,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151680117] [2019-11-23 22:06:51,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,063 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:51,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151680117] [2019-11-23 22:06:51,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267458278] [2019-11-23 22:06:51,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,065 INFO L87 Difference]: Start difference. First operand 5636 states and 9026 transitions. Second operand 3 states. [2019-11-23 22:06:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,126 INFO L93 Difference]: Finished difference Result 8456 states and 13508 transitions. [2019-11-23 22:06:51,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,140 INFO L225 Difference]: With dead ends: 8456 [2019-11-23 22:06:51,141 INFO L226 Difference]: Without dead ends: 5702 [2019-11-23 22:06:51,145 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:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2019-11-23 22:06:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5700. [2019-11-23 22:06:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-23 22:06:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 9026 transitions. [2019-11-23 22:06:51,280 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 9026 transitions. Word has length 28 [2019-11-23 22:06:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,281 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 9026 transitions. [2019-11-23 22:06:51,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 9026 transitions. [2019-11-23 22:06:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:51,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,287 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, 1, 1, 1] [2019-11-23 22:06:51,288 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1902067592, now seen corresponding path program 1 times [2019-11-23 22:06:51,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123526443] [2019-11-23 22:06:51,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,316 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:51,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123526443] [2019-11-23 22:06:51,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504332016] [2019-11-23 22:06:51,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,318 INFO L87 Difference]: Start difference. First operand 5700 states and 9026 transitions. Second operand 3 states. [2019-11-23 22:06:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,438 INFO L93 Difference]: Finished difference Result 10248 states and 16580 transitions. [2019-11-23 22:06:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,463 INFO L225 Difference]: With dead ends: 10248 [2019-11-23 22:06:51,464 INFO L226 Difference]: Without dead ends: 10246 [2019-11-23 22:06:51,468 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:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10246 states. [2019-11-23 22:06:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10246 to 8196. [2019-11-23 22:06:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-11-23 22:06:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 12610 transitions. [2019-11-23 22:06:51,698 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 12610 transitions. Word has length 28 [2019-11-23 22:06:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:51,698 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 12610 transitions. [2019-11-23 22:06:51,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 12610 transitions. [2019-11-23 22:06:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:51,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:51,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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:51,711 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 398754998, now seen corresponding path program 1 times [2019-11-23 22:06:51,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:51,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238289012] [2019-11-23 22:06:51,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:51,741 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:51,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238289012] [2019-11-23 22:06:51,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:51,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:51,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028625198] [2019-11-23 22:06:51,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:51,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,745 INFO L87 Difference]: Start difference. First operand 8196 states and 12610 transitions. Second operand 3 states. [2019-11-23 22:06:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,877 INFO L93 Difference]: Finished difference Result 19208 states and 29764 transitions. [2019-11-23 22:06:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,900 INFO L225 Difference]: With dead ends: 19208 [2019-11-23 22:06:51,900 INFO L226 Difference]: Without dead ends: 11142 [2019-11-23 22:06:51,912 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:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-11-23 22:06:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 11140. [2019-11-23 22:06:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11140 states. [2019-11-23 22:06:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11140 states to 11140 states and 17154 transitions. [2019-11-23 22:06:52,320 INFO L78 Accepts]: Start accepts. Automaton has 11140 states and 17154 transitions. Word has length 28 [2019-11-23 22:06:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:52,321 INFO L462 AbstractCegarLoop]: Abstraction has 11140 states and 17154 transitions. [2019-11-23 22:06:52,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11140 states and 17154 transitions. [2019-11-23 22:06:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:52,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:52,338 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, 1, 1, 1, 1] [2019-11-23 22:06:52,342 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1165660906, now seen corresponding path program 1 times [2019-11-23 22:06:52,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:52,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886896254] [2019-11-23 22:06:52,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:52,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886896254] [2019-11-23 22:06:52,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:52,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:52,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420459111] [2019-11-23 22:06:52,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:52,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:52,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:52,380 INFO L87 Difference]: Start difference. First operand 11140 states and 17154 transitions. Second operand 3 states. [2019-11-23 22:06:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:52,551 INFO L93 Difference]: Finished difference Result 16712 states and 25668 transitions. [2019-11-23 22:06:52,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:52,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:52,581 INFO L225 Difference]: With dead ends: 16712 [2019-11-23 22:06:52,582 INFO L226 Difference]: Without dead ends: 11270 [2019-11-23 22:06:52,594 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:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-11-23 22:06:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11268. [2019-11-23 22:06:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2019-11-23 22:06:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 17154 transitions. [2019-11-23 22:06:52,857 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 17154 transitions. Word has length 29 [2019-11-23 22:06:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:52,857 INFO L462 AbstractCegarLoop]: Abstraction has 11268 states and 17154 transitions. [2019-11-23 22:06:52,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 17154 transitions. [2019-11-23 22:06:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:52,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:52,870 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, 1, 1, 1, 1] [2019-11-23 22:06:52,871 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:52,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash -523282836, now seen corresponding path program 1 times [2019-11-23 22:06:52,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:52,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35550982] [2019-11-23 22:06:52,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:52,896 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:52,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35550982] [2019-11-23 22:06:52,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:52,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:52,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327734263] [2019-11-23 22:06:52,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:52,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:52,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:52,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:52,899 INFO L87 Difference]: Start difference. First operand 11268 states and 17154 transitions. Second operand 3 states. [2019-11-23 22:06:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:53,159 INFO L93 Difference]: Finished difference Result 19976 states and 31108 transitions. [2019-11-23 22:06:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:53,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:53,196 INFO L225 Difference]: With dead ends: 19976 [2019-11-23 22:06:53,196 INFO L226 Difference]: Without dead ends: 19974 [2019-11-23 22:06:53,203 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:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19974 states. [2019-11-23 22:06:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19974 to 16388. [2019-11-23 22:06:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16388 states. [2019-11-23 22:06:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16388 states to 16388 states and 24194 transitions. [2019-11-23 22:06:54,042 INFO L78 Accepts]: Start accepts. Automaton has 16388 states and 24194 transitions. Word has length 29 [2019-11-23 22:06:54,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:54,043 INFO L462 AbstractCegarLoop]: Abstraction has 16388 states and 24194 transitions. [2019-11-23 22:06:54,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 16388 states and 24194 transitions. [2019-11-23 22:06:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:54,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:54,062 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, 1, 1, 1, 1] [2019-11-23 22:06:54,063 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1777539754, now seen corresponding path program 1 times [2019-11-23 22:06:54,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:54,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266195682] [2019-11-23 22:06:54,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:54,082 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:54,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266195682] [2019-11-23 22:06:54,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:54,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:54,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481963096] [2019-11-23 22:06:54,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:54,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:54,084 INFO L87 Difference]: Start difference. First operand 16388 states and 24194 transitions. Second operand 3 states. [2019-11-23 22:06:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:54,290 INFO L93 Difference]: Finished difference Result 38152 states and 56708 transitions. [2019-11-23 22:06:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:54,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:54,331 INFO L225 Difference]: With dead ends: 38152 [2019-11-23 22:06:54,331 INFO L226 Difference]: Without dead ends: 22022 [2019-11-23 22:06:54,353 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:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2019-11-23 22:06:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 22020. [2019-11-23 22:06:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22020 states. [2019-11-23 22:06:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22020 states to 22020 states and 32514 transitions. [2019-11-23 22:06:54,830 INFO L78 Accepts]: Start accepts. Automaton has 22020 states and 32514 transitions. Word has length 29 [2019-11-23 22:06:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:54,830 INFO L462 AbstractCegarLoop]: Abstraction has 22020 states and 32514 transitions. [2019-11-23 22:06:54,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 22020 states and 32514 transitions. [2019-11-23 22:06:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:06:54,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:54,852 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, 1, 1, 1, 1, 1] [2019-11-23 22:06:54,852 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash 958315723, now seen corresponding path program 1 times [2019-11-23 22:06:54,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:54,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065862188] [2019-11-23 22:06:54,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:54,871 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:54,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065862188] [2019-11-23 22:06:54,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:54,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:54,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164735650] [2019-11-23 22:06:54,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:54,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:54,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:54,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:54,873 INFO L87 Difference]: Start difference. First operand 22020 states and 32514 transitions. Second operand 3 states. [2019-11-23 22:06:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:55,050 INFO L93 Difference]: Finished difference Result 33032 states and 48644 transitions. [2019-11-23 22:06:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:55,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-23 22:06:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:55,091 INFO L225 Difference]: With dead ends: 33032 [2019-11-23 22:06:55,091 INFO L226 Difference]: Without dead ends: 22278 [2019-11-23 22:06:55,108 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:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22278 states. [2019-11-23 22:06:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22278 to 22276. [2019-11-23 22:06:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22276 states. [2019-11-23 22:06:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22276 states to 22276 states and 32514 transitions. [2019-11-23 22:06:55,614 INFO L78 Accepts]: Start accepts. Automaton has 22276 states and 32514 transitions. Word has length 30 [2019-11-23 22:06:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:55,614 INFO L462 AbstractCegarLoop]: Abstraction has 22276 states and 32514 transitions. [2019-11-23 22:06:55,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 22276 states and 32514 transitions. [2019-11-23 22:06:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:06:55,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:55,643 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, 1, 1, 1, 1, 1] [2019-11-23 22:06:55,643 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash -730628019, now seen corresponding path program 1 times [2019-11-23 22:06:55,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:55,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259549399] [2019-11-23 22:06:55,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:55,675 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:55,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259549399] [2019-11-23 22:06:55,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:55,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:55,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111015328] [2019-11-23 22:06:55,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:55,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:55,677 INFO L87 Difference]: Start difference. First operand 22276 states and 32514 transitions. Second operand 3 states. [2019-11-23 22:06:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:55,941 INFO L93 Difference]: Finished difference Result 38920 states and 58116 transitions. [2019-11-23 22:06:55,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:55,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-23 22:06:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:55,983 INFO L225 Difference]: With dead ends: 38920 [2019-11-23 22:06:55,983 INFO L226 Difference]: Without dead ends: 38918 [2019-11-23 22:06:55,995 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:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38918 states. [2019-11-23 22:06:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38918 to 32772. [2019-11-23 22:06:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32772 states. [2019-11-23 22:06:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32772 states to 32772 states and 46338 transitions. [2019-11-23 22:06:57,209 INFO L78 Accepts]: Start accepts. Automaton has 32772 states and 46338 transitions. Word has length 30 [2019-11-23 22:06:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,210 INFO L462 AbstractCegarLoop]: Abstraction has 32772 states and 46338 transitions. [2019-11-23 22:06:57,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32772 states and 46338 transitions. [2019-11-23 22:06:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:06:57,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,233 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, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,233 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1570194571, now seen corresponding path program 1 times [2019-11-23 22:06:57,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881506040] [2019-11-23 22:06:57,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,253 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:57,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881506040] [2019-11-23 22:06:57,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424467102] [2019-11-23 22:06:57,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,255 INFO L87 Difference]: Start difference. First operand 32772 states and 46338 transitions. Second operand 3 states. [2019-11-23 22:06:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,730 INFO L93 Difference]: Finished difference Result 75784 states and 107780 transitions. [2019-11-23 22:06:57,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-23 22:06:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,788 INFO L225 Difference]: With dead ends: 75784 [2019-11-23 22:06:57,788 INFO L226 Difference]: Without dead ends: 43526 [2019-11-23 22:06:57,826 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:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43526 states. [2019-11-23 22:06:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43526 to 43524. [2019-11-23 22:06:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43524 states. [2019-11-23 22:06:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43524 states to 43524 states and 61442 transitions. [2019-11-23 22:06:58,923 INFO L78 Accepts]: Start accepts. Automaton has 43524 states and 61442 transitions. Word has length 30 [2019-11-23 22:06:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,924 INFO L462 AbstractCegarLoop]: Abstraction has 43524 states and 61442 transitions. [2019-11-23 22:06:58,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 43524 states and 61442 transitions. [2019-11-23 22:06:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:06:58,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,947 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:58,947 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1174417313, now seen corresponding path program 1 times [2019-11-23 22:06:58,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647338224] [2019-11-23 22:06:58,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,974 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:58,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647338224] [2019-11-23 22:06:58,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319794] [2019-11-23 22:06:58,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,976 INFO L87 Difference]: Start difference. First operand 43524 states and 61442 transitions. Second operand 3 states. [2019-11-23 22:06:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:59,483 INFO L93 Difference]: Finished difference Result 65288 states and 91908 transitions. [2019-11-23 22:06:59,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:59,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:06:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:59,541 INFO L225 Difference]: With dead ends: 65288 [2019-11-23 22:06:59,542 INFO L226 Difference]: Without dead ends: 44038 [2019-11-23 22:06:59,571 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:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44038 states. [2019-11-23 22:07:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44038 to 44036. [2019-11-23 22:07:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44036 states. [2019-11-23 22:07:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44036 states to 44036 states and 61442 transitions. [2019-11-23 22:07:00,731 INFO L78 Accepts]: Start accepts. Automaton has 44036 states and 61442 transitions. Word has length 31 [2019-11-23 22:07:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 44036 states and 61442 transitions. [2019-11-23 22:07:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 44036 states and 61442 transitions. [2019-11-23 22:07:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:07:00,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:00,760 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:00,760 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:00,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1431606241, now seen corresponding path program 1 times [2019-11-23 22:07:00,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:00,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196324126] [2019-11-23 22:07:00,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:00,794 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:07:00,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196324126] [2019-11-23 22:07:00,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:00,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:00,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484150236] [2019-11-23 22:07:00,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:00,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:00,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:00,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:00,799 INFO L87 Difference]: Start difference. First operand 44036 states and 61442 transitions. Second operand 3 states. [2019-11-23 22:07:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:01,809 INFO L93 Difference]: Finished difference Result 129032 states and 178180 transitions. [2019-11-23 22:07:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:01,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:07:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:01,909 INFO L225 Difference]: With dead ends: 129032 [2019-11-23 22:07:01,909 INFO L226 Difference]: Without dead ends: 86022 [2019-11-23 22:07:01,938 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:07:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86022 states. [2019-11-23 22:07:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86022 to 86020. [2019-11-23 22:07:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86020 states. [2019-11-23 22:07:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 116738 transitions. [2019-11-23 22:07:04,394 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 116738 transitions. Word has length 31 [2019-11-23 22:07:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:04,394 INFO L462 AbstractCegarLoop]: Abstraction has 86020 states and 116738 transitions. [2019-11-23 22:07:04,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 116738 transitions. [2019-11-23 22:07:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:07:04,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:04,435 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:04,435 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:04,435 INFO L82 PathProgramCache]: Analyzing trace with hash -869216349, now seen corresponding path program 1 times [2019-11-23 22:07:04,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:04,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437143589] [2019-11-23 22:07:04,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:04,463 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:07:04,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437143589] [2019-11-23 22:07:04,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:04,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:04,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598305910] [2019-11-23 22:07:04,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:04,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:04,465 INFO L87 Difference]: Start difference. First operand 86020 states and 116738 transitions. Second operand 3 states. [2019-11-23 22:07:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:05,083 INFO L93 Difference]: Finished difference Result 96264 states and 135172 transitions. [2019-11-23 22:07:05,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:05,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:07:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:05,161 INFO L225 Difference]: With dead ends: 96264 [2019-11-23 22:07:05,161 INFO L226 Difference]: Without dead ends: 96262 [2019-11-23 22:07:05,178 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:07:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96262 states. [2019-11-23 22:07:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96262 to 86020. [2019-11-23 22:07:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86020 states. [2019-11-23 22:07:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 115714 transitions. [2019-11-23 22:07:06,467 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 115714 transitions. Word has length 31 [2019-11-23 22:07:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:06,467 INFO L462 AbstractCegarLoop]: Abstraction has 86020 states and 115714 transitions. [2019-11-23 22:07:06,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 115714 transitions. [2019-11-23 22:07:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:07:06,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:06,500 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:06,500 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1430335648, now seen corresponding path program 1 times [2019-11-23 22:07:06,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:06,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286086064] [2019-11-23 22:07:06,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:06,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286086064] [2019-11-23 22:07:06,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:06,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:06,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476351464] [2019-11-23 22:07:06,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:06,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:06,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:06,533 INFO L87 Difference]: Start difference. First operand 86020 states and 115714 transitions. Second operand 3 states. [2019-11-23 22:07:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:07,618 INFO L93 Difference]: Finished difference Result 146440 states and 200708 transitions. [2019-11-23 22:07:07,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:07,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:07:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:07,742 INFO L225 Difference]: With dead ends: 146440 [2019-11-23 22:07:07,742 INFO L226 Difference]: Without dead ends: 146438 [2019-11-23 22:07:07,765 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:07:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146438 states. [2019-11-23 22:07:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146438 to 130052. [2019-11-23 22:07:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130052 states. [2019-11-23 22:07:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130052 states to 130052 states and 169986 transitions. [2019-11-23 22:07:10,742 INFO L78 Accepts]: Start accepts. Automaton has 130052 states and 169986 transitions. Word has length 32 [2019-11-23 22:07:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:10,742 INFO L462 AbstractCegarLoop]: Abstraction has 130052 states and 169986 transitions. [2019-11-23 22:07:10,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 130052 states and 169986 transitions. [2019-11-23 22:07:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:07:10,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:10,793 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:10,793 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash -563809058, now seen corresponding path program 1 times [2019-11-23 22:07:10,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:10,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880584289] [2019-11-23 22:07:10,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:10,818 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:07:10,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880584289] [2019-11-23 22:07:10,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:10,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:10,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669916505] [2019-11-23 22:07:10,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:10,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:10,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:10,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:10,819 INFO L87 Difference]: Start difference. First operand 130052 states and 169986 transitions. Second operand 3 states. [2019-11-23 22:07:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:12,373 INFO L93 Difference]: Finished difference Result 297992 states and 391172 transitions. [2019-11-23 22:07:12,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:12,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:07:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:12,548 INFO L225 Difference]: With dead ends: 297992 [2019-11-23 22:07:12,548 INFO L226 Difference]: Without dead ends: 168966 [2019-11-23 22:07:12,606 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:07:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168966 states. [2019-11-23 22:07:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168966 to 168964. [2019-11-23 22:07:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168964 states. [2019-11-23 22:07:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168964 states to 168964 states and 219138 transitions. [2019-11-23 22:07:17,127 INFO L78 Accepts]: Start accepts. Automaton has 168964 states and 219138 transitions. Word has length 32 [2019-11-23 22:07:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:17,128 INFO L462 AbstractCegarLoop]: Abstraction has 168964 states and 219138 transitions. [2019-11-23 22:07:17,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 168964 states and 219138 transitions. [2019-11-23 22:07:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:07:17,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:17,184 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:17,184 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:17,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1390947606, now seen corresponding path program 1 times [2019-11-23 22:07:17,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:17,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608874592] [2019-11-23 22:07:17,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:17,201 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:07:17,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608874592] [2019-11-23 22:07:17,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:17,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:17,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550550744] [2019-11-23 22:07:17,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:17,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:17,202 INFO L87 Difference]: Start difference. First operand 168964 states and 219138 transitions. Second operand 3 states. [2019-11-23 22:07:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:18,706 INFO L93 Difference]: Finished difference Result 254984 states and 330756 transitions. [2019-11-23 22:07:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:18,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:07:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:18,849 INFO L225 Difference]: With dead ends: 254984 [2019-11-23 22:07:18,849 INFO L226 Difference]: Without dead ends: 172038 [2019-11-23 22:07:18,890 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:07:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172038 states. [2019-11-23 22:07:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172038 to 172036. [2019-11-23 22:07:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172036 states. [2019-11-23 22:07:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172036 states to 172036 states and 221186 transitions. [2019-11-23 22:07:23,990 INFO L78 Accepts]: Start accepts. Automaton has 172036 states and 221186 transitions. Word has length 33 [2019-11-23 22:07:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:23,990 INFO L462 AbstractCegarLoop]: Abstraction has 172036 states and 221186 transitions. [2019-11-23 22:07:23,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 172036 states and 221186 transitions. [2019-11-23 22:07:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:07:24,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:24,050 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:24,050 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -297996136, now seen corresponding path program 1 times [2019-11-23 22:07:24,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:24,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012185997] [2019-11-23 22:07:24,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:24,072 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:07:24,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012185997] [2019-11-23 22:07:24,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:24,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:24,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203659302] [2019-11-23 22:07:24,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:24,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:24,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:24,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:24,074 INFO L87 Difference]: Start difference. First operand 172036 states and 221186 transitions. Second operand 3 states. [2019-11-23 22:07:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:26,267 INFO L93 Difference]: Finished difference Result 286728 states and 372740 transitions. [2019-11-23 22:07:26,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:26,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:07:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:26,514 INFO L225 Difference]: With dead ends: 286728 [2019-11-23 22:07:26,514 INFO L226 Difference]: Without dead ends: 286726 [2019-11-23 22:07:26,549 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:07:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286726 states. [2019-11-23 22:07:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286726 to 262148. [2019-11-23 22:07:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262148 states. [2019-11-23 22:07:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262148 states to 262148 states and 327682 transitions. [2019-11-23 22:07:32,390 INFO L78 Accepts]: Start accepts. Automaton has 262148 states and 327682 transitions. Word has length 33 [2019-11-23 22:07:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:32,390 INFO L462 AbstractCegarLoop]: Abstraction has 262148 states and 327682 transitions. [2019-11-23 22:07:32,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 262148 states and 327682 transitions. [2019-11-23 22:07:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:07:32,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:32,507 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:32,507 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2002826454, now seen corresponding path program 1 times [2019-11-23 22:07:32,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:32,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229704796] [2019-11-23 22:07:32,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:32,533 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:07:32,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229704796] [2019-11-23 22:07:32,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:32,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:32,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355657139] [2019-11-23 22:07:32,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:32,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:32,534 INFO L87 Difference]: Start difference. First operand 262148 states and 327682 transitions. Second operand 3 states. [2019-11-23 22:07:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:35,282 INFO L93 Difference]: Finished difference Result 593928 states and 741380 transitions. [2019-11-23 22:07:35,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:35,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:07:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:35,580 INFO L225 Difference]: With dead ends: 593928 [2019-11-23 22:07:35,580 INFO L226 Difference]: Without dead ends: 335878 [2019-11-23 22:07:35,677 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:07:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335878 states. [2019-11-23 22:07:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335878 to 335876. [2019-11-23 22:07:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335876 states. [2019-11-23 22:07:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335876 states to 335876 states and 413698 transitions. [2019-11-23 22:07:44,856 INFO L78 Accepts]: Start accepts. Automaton has 335876 states and 413698 transitions. Word has length 33 [2019-11-23 22:07:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:44,856 INFO L462 AbstractCegarLoop]: Abstraction has 335876 states and 413698 transitions. [2019-11-23 22:07:44,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 335876 states and 413698 transitions. [2019-11-23 22:07:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:07:44,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:44,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:44,984 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:44,984 INFO L82 PathProgramCache]: Analyzing trace with hash -647729805, now seen corresponding path program 1 times [2019-11-23 22:07:44,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:44,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055668917] [2019-11-23 22:07:44,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:45,002 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:07:45,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055668917] [2019-11-23 22:07:45,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:45,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:45,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874077013] [2019-11-23 22:07:45,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:45,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:45,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:45,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:45,004 INFO L87 Difference]: Start difference. First operand 335876 states and 413698 transitions. Second operand 3 states. [2019-11-23 22:07:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:47,793 INFO L93 Difference]: Finished difference Result 503816 states and 618500 transitions. [2019-11-23 22:07:47,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:47,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-23 22:07:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:48,282 INFO L225 Difference]: With dead ends: 503816 [2019-11-23 22:07:48,283 INFO L226 Difference]: Without dead ends: 339974 [2019-11-23 22:07:48,406 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:07:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339974 states.