/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/systemc/transmitter.04.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:50:15,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:50:15,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:50:15,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:50:15,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:50:15,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:50:15,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:50:15,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:50:15,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:50:15,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:50:15,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:50:15,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:50:15,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:50:15,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:50:15,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:50:15,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:50:15,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:50:15,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:50:15,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:50:15,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:50:15,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:50:15,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:50:15,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:50:15,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:50:15,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:50:15,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:50:15,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:50:15,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:50:15,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:50:15,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:50:15,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:50:15,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:50:15,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:50:15,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:50:15,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:50:15,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:50:15,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:50:15,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:50:15,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:50:15,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:50:15,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:50:15,105 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:50:15,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:50:15,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:50:15,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:50:15,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:50:15,121 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:50:15,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:50:15,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:50:15,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:50:15,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:50:15,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:50:15,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:50:15,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:50:15,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:50:15,123 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:50:15,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:50:15,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:50:15,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:50:15,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:50:15,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:50:15,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:50:15,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:50:15,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:50:15,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:50:15,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:50:15,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:50:15,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:50:15,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:50:15,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:50:15,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:50:15,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:50:15,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:50:15,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:50:15,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:50:15,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:50:15,418 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:50:15,419 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-11-23 22:50:15,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609d4ec4b/6380324dd55c4be5b3958ef10e5ea244/FLAG8d76eb66e [2019-11-23 22:50:15,992 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:50:15,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-11-23 22:50:16,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609d4ec4b/6380324dd55c4be5b3958ef10e5ea244/FLAG8d76eb66e [2019-11-23 22:50:16,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609d4ec4b/6380324dd55c4be5b3958ef10e5ea244 [2019-11-23 22:50:16,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:50:16,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:50:16,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:50:16,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:50:16,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:50:16,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:16,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b67295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16, skipping insertion in model container [2019-11-23 22:50:16,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:16,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:50:16,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:50:16,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:50:16,714 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:50:16,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:50:16,870 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:50:16,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16 WrapperNode [2019-11-23 22:50:16,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:50:16,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:50:16,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:50:16,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:50:16,880 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:50:16" (1/1) ... [2019-11-23 22:50:16,889 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:50:16" (1/1) ... [2019-11-23 22:50:16,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:50:16,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:50:16,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:50:16,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:50:16,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:16,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:16,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:16,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:16,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:16,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:16,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (1/1) ... [2019-11-23 22:50:17,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:50:17,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:50:17,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:50:17,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:50:17,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (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:50:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:50:17,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:50:18,250 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:50:18,251 INFO L284 CfgBuilder]: Removed 148 assume(true) statements. [2019-11-23 22:50:18,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:18 BoogieIcfgContainer [2019-11-23 22:50:18,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:50:18,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:50:18,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:50:18,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:50:18,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:50:16" (1/3) ... [2019-11-23 22:50:18,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dd857f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:18, skipping insertion in model container [2019-11-23 22:50:18,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:16" (2/3) ... [2019-11-23 22:50:18,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dd857f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:18, skipping insertion in model container [2019-11-23 22:50:18,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:18" (3/3) ... [2019-11-23 22:50:18,261 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2019-11-23 22:50:18,269 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:50:18,275 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:50:18,286 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:50:18,317 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:50:18,317 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:50:18,317 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:50:18,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:50:18,318 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:50:18,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:50:18,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:50:18,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:50:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states. [2019-11-23 22:50:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:18,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:18,359 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:18,359 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1653942868, now seen corresponding path program 1 times [2019-11-23 22:50:18,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:18,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498005629] [2019-11-23 22:50:18,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:18,556 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:50:18,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498005629] [2019-11-23 22:50:18,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:18,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:18,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420605619] [2019-11-23 22:50:18,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:18,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:18,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:18,583 INFO L87 Difference]: Start difference. First operand 374 states. Second operand 3 states. [2019-11-23 22:50:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:18,686 INFO L93 Difference]: Finished difference Result 743 states and 1159 transitions. [2019-11-23 22:50:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:18,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:18,715 INFO L225 Difference]: With dead ends: 743 [2019-11-23 22:50:18,715 INFO L226 Difference]: Without dead ends: 370 [2019-11-23 22:50:18,725 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:50:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-23 22:50:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2019-11-23 22:50:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-23 22:50:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 561 transitions. [2019-11-23 22:50:18,815 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 561 transitions. Word has length 73 [2019-11-23 22:50:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:18,815 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 561 transitions. [2019-11-23 22:50:18,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 561 transitions. [2019-11-23 22:50:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:18,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:18,819 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:18,819 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1161316694, now seen corresponding path program 1 times [2019-11-23 22:50:18,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:18,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980029157] [2019-11-23 22:50:18,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:18,904 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:50:18,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980029157] [2019-11-23 22:50:18,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:18,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:18,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642815620] [2019-11-23 22:50:18,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:18,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:18,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:18,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:18,908 INFO L87 Difference]: Start difference. First operand 370 states and 561 transitions. Second operand 3 states. [2019-11-23 22:50:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:19,012 INFO L93 Difference]: Finished difference Result 1004 states and 1519 transitions. [2019-11-23 22:50:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:19,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:19,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:19,017 INFO L225 Difference]: With dead ends: 1004 [2019-11-23 22:50:19,017 INFO L226 Difference]: Without dead ends: 643 [2019-11-23 22:50:19,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-11-23 22:50:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2019-11-23 22:50:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 961 transitions. [2019-11-23 22:50:19,064 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 961 transitions. Word has length 73 [2019-11-23 22:50:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:19,064 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 961 transitions. [2019-11-23 22:50:19,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 961 transitions. [2019-11-23 22:50:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:19,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:19,067 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:19,067 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1509510378, now seen corresponding path program 1 times [2019-11-23 22:50:19,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:19,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845558216] [2019-11-23 22:50:19,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:19,113 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:50:19,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845558216] [2019-11-23 22:50:19,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:19,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:19,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264617182] [2019-11-23 22:50:19,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:19,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:19,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:19,115 INFO L87 Difference]: Start difference. First operand 641 states and 961 transitions. Second operand 3 states. [2019-11-23 22:50:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:19,158 INFO L93 Difference]: Finished difference Result 1272 states and 1907 transitions. [2019-11-23 22:50:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:19,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:19,163 INFO L225 Difference]: With dead ends: 1272 [2019-11-23 22:50:19,163 INFO L226 Difference]: Without dead ends: 641 [2019-11-23 22:50:19,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-11-23 22:50:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-11-23 22:50:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-11-23 22:50:19,198 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 73 [2019-11-23 22:50:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:19,198 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-11-23 22:50:19,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-11-23 22:50:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:19,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:19,201 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:19,201 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:19,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1595666090, now seen corresponding path program 1 times [2019-11-23 22:50:19,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:19,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678490984] [2019-11-23 22:50:19,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:19,279 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:50:19,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678490984] [2019-11-23 22:50:19,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:19,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:19,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256583668] [2019-11-23 22:50:19,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:19,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:19,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:19,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:19,283 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-11-23 22:50:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:19,340 INFO L93 Difference]: Finished difference Result 1271 states and 1890 transitions. [2019-11-23 22:50:19,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:19,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:19,346 INFO L225 Difference]: With dead ends: 1271 [2019-11-23 22:50:19,346 INFO L226 Difference]: Without dead ends: 641 [2019-11-23 22:50:19,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-11-23 22:50:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-11-23 22:50:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 945 transitions. [2019-11-23 22:50:19,411 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 945 transitions. Word has length 73 [2019-11-23 22:50:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:19,413 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 945 transitions. [2019-11-23 22:50:19,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 945 transitions. [2019-11-23 22:50:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:19,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:19,414 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:19,415 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:19,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:19,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1178269484, now seen corresponding path program 1 times [2019-11-23 22:50:19,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:19,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521570807] [2019-11-23 22:50:19,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:19,493 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:50:19,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521570807] [2019-11-23 22:50:19,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:19,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:19,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497435771] [2019-11-23 22:50:19,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:19,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:19,496 INFO L87 Difference]: Start difference. First operand 641 states and 945 transitions. Second operand 3 states. [2019-11-23 22:50:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:19,548 INFO L93 Difference]: Finished difference Result 1270 states and 1873 transitions. [2019-11-23 22:50:19,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:19,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:19,553 INFO L225 Difference]: With dead ends: 1270 [2019-11-23 22:50:19,555 INFO L226 Difference]: Without dead ends: 641 [2019-11-23 22:50:19,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-11-23 22:50:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-11-23 22:50:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 937 transitions. [2019-11-23 22:50:19,586 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 937 transitions. Word has length 73 [2019-11-23 22:50:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:19,587 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 937 transitions. [2019-11-23 22:50:19,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 937 transitions. [2019-11-23 22:50:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:19,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:19,589 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:19,589 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash 52103404, now seen corresponding path program 1 times [2019-11-23 22:50:19,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:19,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550879028] [2019-11-23 22:50:19,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:19,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550879028] [2019-11-23 22:50:19,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:19,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:19,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158155720] [2019-11-23 22:50:19,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:19,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:19,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:19,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:19,662 INFO L87 Difference]: Start difference. First operand 641 states and 937 transitions. Second operand 3 states. [2019-11-23 22:50:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:19,728 INFO L93 Difference]: Finished difference Result 1268 states and 1854 transitions. [2019-11-23 22:50:19,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:19,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:19,732 INFO L225 Difference]: With dead ends: 1268 [2019-11-23 22:50:19,733 INFO L226 Difference]: Without dead ends: 641 [2019-11-23 22:50:19,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-11-23 22:50:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-11-23 22:50:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 919 transitions. [2019-11-23 22:50:19,763 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 919 transitions. Word has length 73 [2019-11-23 22:50:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:19,764 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 919 transitions. [2019-11-23 22:50:19,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 919 transitions. [2019-11-23 22:50:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:19,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:19,765 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:19,765 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:19,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2144832493, now seen corresponding path program 1 times [2019-11-23 22:50:19,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:19,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325165394] [2019-11-23 22:50:19,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:19,829 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:50:19,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325165394] [2019-11-23 22:50:19,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:19,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:19,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175680017] [2019-11-23 22:50:19,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:19,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:19,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:19,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:19,835 INFO L87 Difference]: Start difference. First operand 641 states and 919 transitions. Second operand 3 states. [2019-11-23 22:50:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:19,894 INFO L93 Difference]: Finished difference Result 1267 states and 1817 transitions. [2019-11-23 22:50:19,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:19,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:19,898 INFO L225 Difference]: With dead ends: 1267 [2019-11-23 22:50:19,898 INFO L226 Difference]: Without dead ends: 641 [2019-11-23 22:50:19,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-11-23 22:50:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-11-23 22:50:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 901 transitions. [2019-11-23 22:50:19,930 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 901 transitions. Word has length 73 [2019-11-23 22:50:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:19,930 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 901 transitions. [2019-11-23 22:50:19,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 901 transitions. [2019-11-23 22:50:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:19,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:19,931 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:19,932 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1887883821, now seen corresponding path program 1 times [2019-11-23 22:50:19,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:19,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509530996] [2019-11-23 22:50:19,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:19,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:50:19,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509530996] [2019-11-23 22:50:19,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:19,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:19,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512796988] [2019-11-23 22:50:19,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:19,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:19,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:19,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:19,964 INFO L87 Difference]: Start difference. First operand 641 states and 901 transitions. Second operand 3 states. [2019-11-23 22:50:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:20,048 INFO L93 Difference]: Finished difference Result 1266 states and 1780 transitions. [2019-11-23 22:50:20,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:20,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:20,052 INFO L225 Difference]: With dead ends: 1266 [2019-11-23 22:50:20,052 INFO L226 Difference]: Without dead ends: 641 [2019-11-23 22:50:20,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-11-23 22:50:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-11-23 22:50:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 883 transitions. [2019-11-23 22:50:20,085 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 883 transitions. Word has length 73 [2019-11-23 22:50:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:20,085 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 883 transitions. [2019-11-23 22:50:20,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 883 transitions. [2019-11-23 22:50:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:20,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:20,086 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:20,087 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1757929134, now seen corresponding path program 1 times [2019-11-23 22:50:20,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:20,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020936151] [2019-11-23 22:50:20,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:20,122 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:50:20,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020936151] [2019-11-23 22:50:20,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:20,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:20,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052777948] [2019-11-23 22:50:20,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:20,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:20,127 INFO L87 Difference]: Start difference. First operand 641 states and 883 transitions. Second operand 3 states. [2019-11-23 22:50:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:20,194 INFO L93 Difference]: Finished difference Result 1265 states and 1743 transitions. [2019-11-23 22:50:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:20,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:20,198 INFO L225 Difference]: With dead ends: 1265 [2019-11-23 22:50:20,198 INFO L226 Difference]: Without dead ends: 641 [2019-11-23 22:50:20,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-11-23 22:50:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-11-23 22:50:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 865 transitions. [2019-11-23 22:50:20,230 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 865 transitions. Word has length 73 [2019-11-23 22:50:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:20,231 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 865 transitions. [2019-11-23 22:50:20,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 865 transitions. [2019-11-23 22:50:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:20,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:20,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:20,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1024701678, now seen corresponding path program 1 times [2019-11-23 22:50:20,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:20,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232565203] [2019-11-23 22:50:20,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:20,293 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:50:20,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232565203] [2019-11-23 22:50:20,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:20,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:20,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926078012] [2019-11-23 22:50:20,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:20,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:20,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:20,295 INFO L87 Difference]: Start difference. First operand 641 states and 865 transitions. Second operand 3 states. [2019-11-23 22:50:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:20,338 INFO L93 Difference]: Finished difference Result 1269 states and 1712 transitions. [2019-11-23 22:50:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:20,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:20,343 INFO L225 Difference]: With dead ends: 1269 [2019-11-23 22:50:20,343 INFO L226 Difference]: Without dead ends: 641 [2019-11-23 22:50:20,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-11-23 22:50:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-11-23 22:50:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-23 22:50:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 857 transitions. [2019-11-23 22:50:20,375 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 857 transitions. Word has length 73 [2019-11-23 22:50:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:20,376 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 857 transitions. [2019-11-23 22:50:20,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 857 transitions. [2019-11-23 22:50:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:50:20,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:20,377 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, 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, 1, 1, 1, 1, 1] [2019-11-23 22:50:20,377 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:20,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1243556396, now seen corresponding path program 1 times [2019-11-23 22:50:20,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:20,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994497291] [2019-11-23 22:50:20,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:20,418 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:50:20,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994497291] [2019-11-23 22:50:20,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:20,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:20,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154892622] [2019-11-23 22:50:20,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:20,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:20,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:20,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:20,420 INFO L87 Difference]: Start difference. First operand 641 states and 857 transitions. Second operand 3 states. [2019-11-23 22:50:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:20,535 INFO L93 Difference]: Finished difference Result 1812 states and 2410 transitions. [2019-11-23 22:50:20,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:20,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:50:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:20,543 INFO L225 Difference]: With dead ends: 1812 [2019-11-23 22:50:20,543 INFO L226 Difference]: Without dead ends: 1232 [2019-11-23 22:50:20,545 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:50:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-23 22:50:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1168. [2019-11-23 22:50:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2019-11-23 22:50:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1539 transitions. [2019-11-23 22:50:20,608 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1539 transitions. Word has length 73 [2019-11-23 22:50:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:20,608 INFO L462 AbstractCegarLoop]: Abstraction has 1168 states and 1539 transitions. [2019-11-23 22:50:20,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1539 transitions. [2019-11-23 22:50:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:50:20,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:20,610 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, 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:20,610 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -546581241, now seen corresponding path program 1 times [2019-11-23 22:50:20,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:20,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097625802] [2019-11-23 22:50:20,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:20,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097625802] [2019-11-23 22:50:20,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:20,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:20,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366746854] [2019-11-23 22:50:20,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:20,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:20,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:20,647 INFO L87 Difference]: Start difference. First operand 1168 states and 1539 transitions. Second operand 3 states. [2019-11-23 22:50:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:20,795 INFO L93 Difference]: Finished difference Result 3182 states and 4193 transitions. [2019-11-23 22:50:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:20,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-23 22:50:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:20,805 INFO L225 Difference]: With dead ends: 3182 [2019-11-23 22:50:20,805 INFO L226 Difference]: Without dead ends: 2132 [2019-11-23 22:50:20,807 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:50:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-23 22:50:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2034. [2019-11-23 22:50:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-11-23 22:50:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2664 transitions. [2019-11-23 22:50:20,906 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2664 transitions. Word has length 74 [2019-11-23 22:50:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:20,906 INFO L462 AbstractCegarLoop]: Abstraction has 2034 states and 2664 transitions. [2019-11-23 22:50:20,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2664 transitions. [2019-11-23 22:50:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 22:50:20,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:20,908 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:20,908 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:20,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:20,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1027993841, now seen corresponding path program 1 times [2019-11-23 22:50:20,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:20,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079525690] [2019-11-23 22:50:20,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:20,943 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:50:20,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079525690] [2019-11-23 22:50:20,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:20,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:20,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488428521] [2019-11-23 22:50:20,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:20,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:20,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:20,946 INFO L87 Difference]: Start difference. First operand 2034 states and 2664 transitions. Second operand 3 states. [2019-11-23 22:50:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:21,273 INFO L93 Difference]: Finished difference Result 5772 states and 7544 transitions. [2019-11-23 22:50:21,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:21,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-23 22:50:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:21,293 INFO L225 Difference]: With dead ends: 5772 [2019-11-23 22:50:21,293 INFO L226 Difference]: Without dead ends: 3856 [2019-11-23 22:50:21,297 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:50:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2019-11-23 22:50:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3718. [2019-11-23 22:50:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2019-11-23 22:50:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 4834 transitions. [2019-11-23 22:50:21,475 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 4834 transitions. Word has length 75 [2019-11-23 22:50:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:21,476 INFO L462 AbstractCegarLoop]: Abstraction has 3718 states and 4834 transitions. [2019-11-23 22:50:21,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 4834 transitions. [2019-11-23 22:50:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 22:50:21,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:21,478 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:21,478 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:21,479 INFO L82 PathProgramCache]: Analyzing trace with hash -934868943, now seen corresponding path program 1 times [2019-11-23 22:50:21,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:21,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032931682] [2019-11-23 22:50:21,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:21,508 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:50:21,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032931682] [2019-11-23 22:50:21,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:21,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:21,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541264124] [2019-11-23 22:50:21,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:21,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:21,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:21,513 INFO L87 Difference]: Start difference. First operand 3718 states and 4834 transitions. Second operand 3 states. [2019-11-23 22:50:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:21,778 INFO L93 Difference]: Finished difference Result 7254 states and 9443 transitions. [2019-11-23 22:50:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:21,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-23 22:50:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:21,796 INFO L225 Difference]: With dead ends: 7254 [2019-11-23 22:50:21,797 INFO L226 Difference]: Without dead ends: 3608 [2019-11-23 22:50:21,802 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:50:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2019-11-23 22:50:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3608. [2019-11-23 22:50:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3608 states. [2019-11-23 22:50:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 4698 transitions. [2019-11-23 22:50:21,975 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 4698 transitions. Word has length 75 [2019-11-23 22:50:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:21,976 INFO L462 AbstractCegarLoop]: Abstraction has 3608 states and 4698 transitions. [2019-11-23 22:50:21,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 4698 transitions. [2019-11-23 22:50:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 22:50:21,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:21,977 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:21,977 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash -607730891, now seen corresponding path program 1 times [2019-11-23 22:50:21,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:21,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685761737] [2019-11-23 22:50:21,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:22,010 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:50:22,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685761737] [2019-11-23 22:50:22,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:22,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:22,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470034945] [2019-11-23 22:50:22,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:22,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:22,013 INFO L87 Difference]: Start difference. First operand 3608 states and 4698 transitions. Second operand 3 states. [2019-11-23 22:50:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:22,430 INFO L93 Difference]: Finished difference Result 10194 states and 13246 transitions. [2019-11-23 22:50:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:22,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-23 22:50:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:22,461 INFO L225 Difference]: With dead ends: 10194 [2019-11-23 22:50:22,461 INFO L226 Difference]: Without dead ends: 6704 [2019-11-23 22:50:22,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:50:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6704 states. [2019-11-23 22:50:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6704 to 6542. [2019-11-23 22:50:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-11-23 22:50:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 8460 transitions. [2019-11-23 22:50:22,767 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 8460 transitions. Word has length 76 [2019-11-23 22:50:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:22,767 INFO L462 AbstractCegarLoop]: Abstraction has 6542 states and 8460 transitions. [2019-11-23 22:50:22,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 8460 transitions. [2019-11-23 22:50:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 22:50:22,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:22,770 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:22,770 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash 906360113, now seen corresponding path program 1 times [2019-11-23 22:50:22,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:22,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420745892] [2019-11-23 22:50:22,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:22,792 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:50:22,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420745892] [2019-11-23 22:50:22,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:22,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:22,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474204564] [2019-11-23 22:50:22,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:22,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:22,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:22,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:22,797 INFO L87 Difference]: Start difference. First operand 6542 states and 8460 transitions. Second operand 3 states. [2019-11-23 22:50:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:23,170 INFO L93 Difference]: Finished difference Result 12890 states and 16683 transitions. [2019-11-23 22:50:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:23,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-23 22:50:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:23,204 INFO L225 Difference]: With dead ends: 12890 [2019-11-23 22:50:23,204 INFO L226 Difference]: Without dead ends: 6434 [2019-11-23 22:50:23,220 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:50:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6434 states. [2019-11-23 22:50:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6434 to 6434. [2019-11-23 22:50:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6434 states. [2019-11-23 22:50:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 8328 transitions. [2019-11-23 22:50:23,617 INFO L78 Accepts]: Start accepts. Automaton has 6434 states and 8328 transitions. Word has length 76 [2019-11-23 22:50:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:23,618 INFO L462 AbstractCegarLoop]: Abstraction has 6434 states and 8328 transitions. [2019-11-23 22:50:23,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6434 states and 8328 transitions. [2019-11-23 22:50:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 22:50:23,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:23,619 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:23,620 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 675279555, now seen corresponding path program 1 times [2019-11-23 22:50:23,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:23,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758934669] [2019-11-23 22:50:23,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:23,656 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:50:23,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758934669] [2019-11-23 22:50:23,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:23,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:23,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492563764] [2019-11-23 22:50:23,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:23,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:23,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:23,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:23,659 INFO L87 Difference]: Start difference. First operand 6434 states and 8328 transitions. Second operand 3 states. [2019-11-23 22:50:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:24,246 INFO L93 Difference]: Finished difference Result 18946 states and 24537 transitions. [2019-11-23 22:50:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:24,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-23 22:50:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:24,276 INFO L225 Difference]: With dead ends: 18946 [2019-11-23 22:50:24,276 INFO L226 Difference]: Without dead ends: 12602 [2019-11-23 22:50:24,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12602 states. [2019-11-23 22:50:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12602 to 12538. [2019-11-23 22:50:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12538 states. [2019-11-23 22:50:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12538 states to 12538 states and 16110 transitions. [2019-11-23 22:50:25,032 INFO L78 Accepts]: Start accepts. Automaton has 12538 states and 16110 transitions. Word has length 77 [2019-11-23 22:50:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:25,033 INFO L462 AbstractCegarLoop]: Abstraction has 12538 states and 16110 transitions. [2019-11-23 22:50:25,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 12538 states and 16110 transitions. [2019-11-23 22:50:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 22:50:25,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:25,041 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:50:25,041 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1687722621, now seen corresponding path program 1 times [2019-11-23 22:50:25,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:25,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638380382] [2019-11-23 22:50:25,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:25,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638380382] [2019-11-23 22:50:25,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:25,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:25,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952083577] [2019-11-23 22:50:25,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:25,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:25,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:25,115 INFO L87 Difference]: Start difference. First operand 12538 states and 16110 transitions. Second operand 3 states. [2019-11-23 22:50:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:26,270 INFO L93 Difference]: Finished difference Result 37260 states and 47825 transitions. [2019-11-23 22:50:26,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:26,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-23 22:50:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:26,323 INFO L225 Difference]: With dead ends: 37260 [2019-11-23 22:50:26,323 INFO L226 Difference]: Without dead ends: 24838 [2019-11-23 22:50:26,344 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:50:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24838 states. [2019-11-23 22:50:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24838 to 24838. [2019-11-23 22:50:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24838 states. [2019-11-23 22:50:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24838 states to 24838 states and 31776 transitions. [2019-11-23 22:50:27,509 INFO L78 Accepts]: Start accepts. Automaton has 24838 states and 31776 transitions. Word has length 96 [2019-11-23 22:50:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:27,509 INFO L462 AbstractCegarLoop]: Abstraction has 24838 states and 31776 transitions. [2019-11-23 22:50:27,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 24838 states and 31776 transitions. [2019-11-23 22:50:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 22:50:27,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:27,528 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:50:27,528 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:27,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash 393922111, now seen corresponding path program 1 times [2019-11-23 22:50:27,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:27,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496008220] [2019-11-23 22:50:27,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 22:50:27,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496008220] [2019-11-23 22:50:27,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:27,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:27,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096024581] [2019-11-23 22:50:27,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:27,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:27,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:27,626 INFO L87 Difference]: Start difference. First operand 24838 states and 31776 transitions. Second operand 3 states. [2019-11-23 22:50:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:29,397 INFO L93 Difference]: Finished difference Result 60602 states and 77478 transitions. [2019-11-23 22:50:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:29,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 22:50:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:29,470 INFO L225 Difference]: With dead ends: 60602 [2019-11-23 22:50:29,470 INFO L226 Difference]: Without dead ends: 35876 [2019-11-23 22:50:29,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35876 states. [2019-11-23 22:50:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35876 to 35746. [2019-11-23 22:50:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35746 states. [2019-11-23 22:50:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35746 states to 35746 states and 45448 transitions. [2019-11-23 22:50:30,653 INFO L78 Accepts]: Start accepts. Automaton has 35746 states and 45448 transitions. Word has length 131 [2019-11-23 22:50:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:30,654 INFO L462 AbstractCegarLoop]: Abstraction has 35746 states and 45448 transitions. [2019-11-23 22:50:30,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 35746 states and 45448 transitions. [2019-11-23 22:50:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 22:50:30,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:30,678 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:50:30,678 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 760471151, now seen corresponding path program 1 times [2019-11-23 22:50:30,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:30,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274630717] [2019-11-23 22:50:30,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 22:50:30,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274630717] [2019-11-23 22:50:30,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:30,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:30,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660743940] [2019-11-23 22:50:30,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:30,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:30,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,741 INFO L87 Difference]: Start difference. First operand 35746 states and 45448 transitions. Second operand 3 states. [2019-11-23 22:50:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:32,705 INFO L93 Difference]: Finished difference Result 87290 states and 110962 transitions. [2019-11-23 22:50:32,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:32,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 22:50:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:32,810 INFO L225 Difference]: With dead ends: 87290 [2019-11-23 22:50:32,810 INFO L226 Difference]: Without dead ends: 51680 [2019-11-23 22:50:32,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51680 states. [2019-11-23 22:50:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51680 to 51486. [2019-11-23 22:50:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51486 states. [2019-11-23 22:50:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51486 states to 51486 states and 65112 transitions. [2019-11-23 22:50:34,554 INFO L78 Accepts]: Start accepts. Automaton has 51486 states and 65112 transitions. Word has length 131 [2019-11-23 22:50:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:34,555 INFO L462 AbstractCegarLoop]: Abstraction has 51486 states and 65112 transitions. [2019-11-23 22:50:34,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 51486 states and 65112 transitions. [2019-11-23 22:50:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 22:50:34,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:34,579 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:50:34,579 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -776225517, now seen corresponding path program 1 times [2019-11-23 22:50:34,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:34,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388595413] [2019-11-23 22:50:34,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 22:50:34,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388595413] [2019-11-23 22:50:34,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:34,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:34,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712898493] [2019-11-23 22:50:34,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:34,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:34,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:34,647 INFO L87 Difference]: Start difference. First operand 51486 states and 65112 transitions. Second operand 3 states. [2019-11-23 22:50:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:37,247 INFO L93 Difference]: Finished difference Result 125690 states and 158770 transitions. [2019-11-23 22:50:37,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:37,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 22:50:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:37,344 INFO L225 Difference]: With dead ends: 125690 [2019-11-23 22:50:37,344 INFO L226 Difference]: Without dead ends: 74288 [2019-11-23 22:50:37,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74288 states. [2019-11-23 22:50:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74288 to 73998. [2019-11-23 22:50:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73998 states. [2019-11-23 22:50:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73998 states to 73998 states and 92936 transitions. [2019-11-23 22:50:39,327 INFO L78 Accepts]: Start accepts. Automaton has 73998 states and 92936 transitions. Word has length 131 [2019-11-23 22:50:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:39,327 INFO L462 AbstractCegarLoop]: Abstraction has 73998 states and 92936 transitions. [2019-11-23 22:50:39,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 73998 states and 92936 transitions. [2019-11-23 22:50:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 22:50:39,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:39,353 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:50:39,353 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash 216677618, now seen corresponding path program 1 times [2019-11-23 22:50:39,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:39,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823939705] [2019-11-23 22:50:39,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:50:39,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823939705] [2019-11-23 22:50:39,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:39,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:50:39,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869609505] [2019-11-23 22:50:39,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:50:39,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:39,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:50:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:50:39,430 INFO L87 Difference]: Start difference. First operand 73998 states and 92936 transitions. Second operand 5 states. [2019-11-23 22:50:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:43,828 INFO L93 Difference]: Finished difference Result 179776 states and 227199 transitions. [2019-11-23 22:50:43,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:50:43,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-11-23 22:50:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:43,930 INFO L225 Difference]: With dead ends: 179776 [2019-11-23 22:50:43,930 INFO L226 Difference]: Without dead ends: 105878 [2019-11-23 22:50:43,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:50:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105878 states. [2019-11-23 22:50:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105878 to 74430. [2019-11-23 22:50:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74430 states. [2019-11-23 22:50:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74430 states to 74430 states and 92212 transitions. [2019-11-23 22:50:46,261 INFO L78 Accepts]: Start accepts. Automaton has 74430 states and 92212 transitions. Word has length 131 [2019-11-23 22:50:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:46,262 INFO L462 AbstractCegarLoop]: Abstraction has 74430 states and 92212 transitions. [2019-11-23 22:50:46,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:50:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 74430 states and 92212 transitions. [2019-11-23 22:50:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 22:50:46,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:46,284 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:50:46,284 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1889102986, now seen corresponding path program 1 times [2019-11-23 22:50:46,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:46,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950177615] [2019-11-23 22:50:46,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:46,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950177615] [2019-11-23 22:50:46,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:46,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:46,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757675916] [2019-11-23 22:50:46,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:46,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:46,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:46,342 INFO L87 Difference]: Start difference. First operand 74430 states and 92212 transitions. Second operand 3 states. [2019-11-23 22:50:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:48,404 INFO L93 Difference]: Finished difference Result 112028 states and 139157 transitions. [2019-11-23 22:50:48,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:48,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 22:50:48,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:48,476 INFO L225 Difference]: With dead ends: 112028 [2019-11-23 22:50:48,476 INFO L226 Difference]: Without dead ends: 74430 [2019-11-23 22:50:48,507 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:50:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74430 states. [2019-11-23 22:50:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74430 to 74216. [2019-11-23 22:50:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74216 states. [2019-11-23 22:50:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74216 states to 74216 states and 91134 transitions. [2019-11-23 22:50:52,151 INFO L78 Accepts]: Start accepts. Automaton has 74216 states and 91134 transitions. Word has length 131 [2019-11-23 22:50:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:52,151 INFO L462 AbstractCegarLoop]: Abstraction has 74216 states and 91134 transitions. [2019-11-23 22:50:52,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 74216 states and 91134 transitions. [2019-11-23 22:50:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-23 22:50:52,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:52,171 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:50:52,172 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:52,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1177275041, now seen corresponding path program 1 times [2019-11-23 22:50:52,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:52,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168596947] [2019-11-23 22:50:52,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 22:50:52,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168596947] [2019-11-23 22:50:52,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:52,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:50:52,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307411153] [2019-11-23 22:50:52,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:50:52,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:52,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:50:52,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:50:52,510 INFO L87 Difference]: Start difference. First operand 74216 states and 91134 transitions. Second operand 5 states. [2019-11-23 22:50:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:55,976 INFO L93 Difference]: Finished difference Result 172884 states and 213543 transitions. [2019-11-23 22:50:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:50:55,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-11-23 22:50:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:56,070 INFO L225 Difference]: With dead ends: 172884 [2019-11-23 22:50:56,070 INFO L226 Difference]: Without dead ends: 98792 [2019-11-23 22:50:56,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:50:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98792 states. [2019-11-23 22:51:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98792 to 74504. [2019-11-23 22:51:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74504 states. [2019-11-23 22:51:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74504 states to 74504 states and 90218 transitions. [2019-11-23 22:51:00,704 INFO L78 Accepts]: Start accepts. Automaton has 74504 states and 90218 transitions. Word has length 132 [2019-11-23 22:51:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:00,704 INFO L462 AbstractCegarLoop]: Abstraction has 74504 states and 90218 transitions. [2019-11-23 22:51:00,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:51:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 74504 states and 90218 transitions. [2019-11-23 22:51:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-23 22:51:00,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:00,727 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:51:00,727 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1238601315, now seen corresponding path program 1 times [2019-11-23 22:51:00,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:00,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691999380] [2019-11-23 22:51:00,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 22:51:00,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691999380] [2019-11-23 22:51:00,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:00,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:51:00,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744187500] [2019-11-23 22:51:00,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:51:00,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:00,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:51:00,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:51:00,796 INFO L87 Difference]: Start difference. First operand 74504 states and 90218 transitions. Second operand 5 states. [2019-11-23 22:51:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:05,559 INFO L93 Difference]: Finished difference Result 176172 states and 214583 transitions. [2019-11-23 22:51:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:51:05,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-11-23 22:51:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:05,658 INFO L225 Difference]: With dead ends: 176172 [2019-11-23 22:51:05,659 INFO L226 Difference]: Without dead ends: 101816 [2019-11-23 22:51:05,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:51:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101816 states. [2019-11-23 22:51:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101816 to 74792. [2019-11-23 22:51:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74792 states. [2019-11-23 22:51:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74792 states to 74792 states and 89302 transitions. [2019-11-23 22:51:10,971 INFO L78 Accepts]: Start accepts. Automaton has 74792 states and 89302 transitions. Word has length 132 [2019-11-23 22:51:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:10,971 INFO L462 AbstractCegarLoop]: Abstraction has 74792 states and 89302 transitions. [2019-11-23 22:51:10,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:51:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 74792 states and 89302 transitions. [2019-11-23 22:51:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-23 22:51:10,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:10,992 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:51:10,992 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:10,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1048246887, now seen corresponding path program 1 times [2019-11-23 22:51:10,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:10,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955258258] [2019-11-23 22:51:10,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 22:51:11,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955258258] [2019-11-23 22:51:11,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:11,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:51:11,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893093369] [2019-11-23 22:51:11,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:51:11,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:51:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:51:11,063 INFO L87 Difference]: Start difference. First operand 74792 states and 89302 transitions. Second operand 5 states. [2019-11-23 22:51:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:15,448 INFO L93 Difference]: Finished difference Result 144386 states and 173411 transitions. [2019-11-23 22:51:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:51:15,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-11-23 22:51:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:15,514 INFO L225 Difference]: With dead ends: 144386 [2019-11-23 22:51:15,514 INFO L226 Difference]: Without dead ends: 69686 [2019-11-23 22:51:15,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:51:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69686 states. [2019-11-23 22:51:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69686 to 50828. [2019-11-23 22:51:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50828 states. [2019-11-23 22:51:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50828 states to 50828 states and 59968 transitions. [2019-11-23 22:51:18,154 INFO L78 Accepts]: Start accepts. Automaton has 50828 states and 59968 transitions. Word has length 132 [2019-11-23 22:51:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:18,154 INFO L462 AbstractCegarLoop]: Abstraction has 50828 states and 59968 transitions. [2019-11-23 22:51:18,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:51:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 50828 states and 59968 transitions. [2019-11-23 22:51:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 22:51:18,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:18,165 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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:51:18,165 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash -307341713, now seen corresponding path program 1 times [2019-11-23 22:51:18,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:18,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494009241] [2019-11-23 22:51:18,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:51:18,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494009241] [2019-11-23 22:51:18,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:18,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:51:18,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211136808] [2019-11-23 22:51:18,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:51:18,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:18,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:51:18,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:51:18,206 INFO L87 Difference]: Start difference. First operand 50828 states and 59968 transitions. Second operand 3 states. [2019-11-23 22:51:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:20,537 INFO L93 Difference]: Finished difference Result 81694 states and 96668 transitions. [2019-11-23 22:51:20,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:51:20,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-23 22:51:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:20,574 INFO L225 Difference]: With dead ends: 81694 [2019-11-23 22:51:20,575 INFO L226 Difference]: Without dead ends: 42420 [2019-11-23 22:51:20,597 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:51:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42420 states. [2019-11-23 22:51:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42420 to 42416. [2019-11-23 22:51:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42416 states. [2019-11-23 22:51:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42416 states to 42416 states and 50000 transitions. [2019-11-23 22:51:22,793 INFO L78 Accepts]: Start accepts. Automaton has 42416 states and 50000 transitions. Word has length 134 [2019-11-23 22:51:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:22,793 INFO L462 AbstractCegarLoop]: Abstraction has 42416 states and 50000 transitions. [2019-11-23 22:51:22,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:51:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 42416 states and 50000 transitions. [2019-11-23 22:51:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 22:51:22,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:22,806 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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:51:22,806 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash -451521753, now seen corresponding path program 1 times [2019-11-23 22:51:22,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:22,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675857622] [2019-11-23 22:51:22,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:51:22,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675857622] [2019-11-23 22:51:22,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:22,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:51:22,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573093625] [2019-11-23 22:51:22,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:51:22,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:22,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:51:22,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:51:22,861 INFO L87 Difference]: Start difference. First operand 42416 states and 50000 transitions. Second operand 3 states. [2019-11-23 22:51:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:25,709 INFO L93 Difference]: Finished difference Result 69170 states and 81824 transitions. [2019-11-23 22:51:25,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:51:25,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 22:51:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:25,740 INFO L225 Difference]: With dead ends: 69170 [2019-11-23 22:51:25,740 INFO L226 Difference]: Without dead ends: 33872 [2019-11-23 22:51:25,763 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:51:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33872 states. [2019-11-23 22:51:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33872 to 33868. [2019-11-23 22:51:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33868 states. [2019-11-23 22:51:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33868 states to 33868 states and 39884 transitions. [2019-11-23 22:51:27,316 INFO L78 Accepts]: Start accepts. Automaton has 33868 states and 39884 transitions. Word has length 173 [2019-11-23 22:51:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:27,316 INFO L462 AbstractCegarLoop]: Abstraction has 33868 states and 39884 transitions. [2019-11-23 22:51:27,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:51:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 33868 states and 39884 transitions. [2019-11-23 22:51:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 22:51:27,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:27,327 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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:51:27,328 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1942944609, now seen corresponding path program 1 times [2019-11-23 22:51:27,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:27,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576358371] [2019-11-23 22:51:27,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:51:27,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576358371] [2019-11-23 22:51:27,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:27,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:51:27,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916682063] [2019-11-23 22:51:27,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:51:27,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:51:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:51:27,380 INFO L87 Difference]: Start difference. First operand 33868 states and 39884 transitions. Second operand 3 states. [2019-11-23 22:51:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:29,086 INFO L93 Difference]: Finished difference Result 63390 states and 74832 transitions. [2019-11-23 22:51:29,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:51:29,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-23 22:51:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:29,113 INFO L225 Difference]: With dead ends: 63390 [2019-11-23 22:51:29,113 INFO L226 Difference]: Without dead ends: 33872 [2019-11-23 22:51:29,126 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:51:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33872 states. [2019-11-23 22:51:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33872 to 33868. [2019-11-23 22:51:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33868 states. [2019-11-23 22:51:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33868 states to 33868 states and 39684 transitions. [2019-11-23 22:51:30,571 INFO L78 Accepts]: Start accepts. Automaton has 33868 states and 39684 transitions. Word has length 212 [2019-11-23 22:51:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:30,571 INFO L462 AbstractCegarLoop]: Abstraction has 33868 states and 39684 transitions. [2019-11-23 22:51:30,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:51:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 33868 states and 39684 transitions. [2019-11-23 22:51:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-23 22:51:30,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:30,585 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1] [2019-11-23 22:51:30,585 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -980083650, now seen corresponding path program 1 times [2019-11-23 22:51:30,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:30,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090024372] [2019-11-23 22:51:30,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:51:30,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090024372] [2019-11-23 22:51:30,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:30,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:51:30,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839678221] [2019-11-23 22:51:30,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:51:30,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:51:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:51:30,662 INFO L87 Difference]: Start difference. First operand 33868 states and 39684 transitions. Second operand 5 states. [2019-11-23 22:51:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:34,934 INFO L93 Difference]: Finished difference Result 107663 states and 125750 transitions. [2019-11-23 22:51:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:51:34,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2019-11-23 22:51:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:35,000 INFO L225 Difference]: With dead ends: 107663 [2019-11-23 22:51:35,001 INFO L226 Difference]: Without dead ends: 73872 [2019-11-23 22:51:35,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:51:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73872 states.